- MatrixAndQuaternionsFaq . . . . 94 matches
[[TableOfContents]]
== Contents of article ==
Q2. What is the order of a matrix?
Q3. How do I represent a matrix using the C/C++ programming languages?
Q4. What are the advantages of using matrices?
Q5. How do matrices relate to coordinate systems?
Q7. What is the major diagonal matrix of a matrix?
Q8. What is the transpose of a matrix?
Q9. How do I add two matrices together?
Q10. How do I subtract two matrices?
Q11. How do I multiply two matrices together?
Q12. How do I square or raise a matrix to a power?
Q13. How do I multiply one or more vectors by a matrix?
Q14. What is the determinant of a matrix?
Q15. How do I calculate the determinant of a matrix?
Q17. What is the inverse of a matrix?
Q18. How do I calculate the inverse of an arbitary matrix?
Q19. How do I calculate the inverse of an identity matrix?
Q20. How do I calculate the inverse of a rotation matrix?
Q21. How do I calculate the inverse of a matrix using Kramer's rule?
- 윤종하/지뢰찾기 . . . . 49 matches
int iNumOfMine;//주변에 있는 지뢰의 개수
COORD* make_mine_map(CELL** map,COORD size,int iNumOfMine);
void print_map(CELL** map,COORD size,int iNumOfMine,int iCurrentFindedMine);
int click_cell(CELL** map,COORD size,int *iNumOfLeftCell);
void one_right_click_cell(CELL** map,COORD size,COORD *cPosOfMine,int iNumOfMine,int *iFindedRealMine);
void find_mine(CELL** map,COORD size,COORD pos,int *iNumOfLeftCell);
int search_mine(int iNumOfMine,COORD* real_mine_cell,COORD target_cell);
COORD *cPosOfMine;
int iNumOfMine,iCurrentFindedMine=0,iNumOfLeftCell,iIsAlive=TRUE,tempX,tempY,iFindedRealMine=0,i,j;
map=(CELL**)malloc(sizeof(CELL)*size.Y);//1차동적할당
map[i]=(CELL*)malloc(sizeof(CELL)*size.X);//2차동적할당
if(argc==4) iNumOfMine=atoi(argv[3]);////argument로의 지뢰 개수 입력이 있을 경우
scanf("%d",&iNumOfMine);
cPosOfMine=make_mine_map(map,size,iNumOfMine);
iNumOfLeftCell=size.X*size.Y;
print_map(map,size,iNumOfMine,iCurrentFindedMine);
iIsAlive=click_cell(map,size,&iNumOfLeftCell);
one_right_click_cell(map,size,cPosOfMine,iNumOfMine,&iFindedRealMine);
free(cPosOfMine);
}while(iNumOfLeftCell>iNumOfMine && iIsAlive==TRUE && iFindedRealMine!=iNumOfMine);
- LinkedList/영동 . . . . 48 matches
int data; //Data of node
Node * nextNode; //Address value of next node
nextNode='\0'; //Assign null value to address of next node
int enterData(); //Function which enter the data of node
void displayList(Node * argNode); //Function which displays the elements of linked list
Node * currentNode;//Create temporary node which indicates the last node of linked list
if(tempNode->nextNode=='\0')//Exit from do-while loop if value of next node is null
int data; //Data of node
Node * nextNode; //Address value of next node
nextNode='\0'; //Assign null value to address of next node
#define MAX_OF_LIST 8 //Maximum number of linked list and free space list
int enterData(); //Function which enter the data of node
void displayList(Node * argNode); //Function which displays the elements of linked list
Node * allocateNewNode(Node * argNode, int argData, int * argNumberOfElements);//Function which allocates new node in memory
Node * reverseList(Node * argNode);//Function which reverses the sequence of the list
void eraseLastNode(Node * argNode, Node ** argFreeNode, int * argNumberOfList, int * argNumberOfFreeSpace);//Function which deletes the last node of the list
void getNode(Node * argNode, Node ** argFreeNode, int * argNumberOfList, int * argNumberOfFreeSpace);//Function which takes the node from free space list
void returnNode(Node * argNode, Node ** argFreeNode, int * argNumberOfList, int * argNumberOfFreeSpace);//Function which return a node of linked list to free space list
int elementsOfLinkedList=0;
int elementsOfFreeSpaceList=0;
- 비행기게임/BasisSource . . . . 35 matches
patientOfInducement = 50
speedIncreaseRateOfY = 0.1
if self.rect.centery<(self.playerPosY-self.patientOfInducement):
self.speedy+=self.speedIncreaseRateOfY
elif self.rect.centery>(self.playerPosY+self.patientOfInducement):
self.speedy-=self.speedIncreaseRateOfY
class SuperClassOfEachClass(pygame.sprite.Sprite):
class Item(pygame.sprite.Sprite, SuperClassOfEachClass):
class Enemy(pygame.sprite.Sprite, SuperClassOfEachClass):
#Default gauage of Enemys
class Building(pygame.sprite.Sprite,SuperClassOfEachClass):
# To do show in GUI
def DynamicEnemyAssign(enemyList, countOfEnemy, Enemy, life, imageMax, enemy_containers, Enemy_img, pathAndKinds, line, playerPosY):
enemyList[countOfEnemy] = Enemy(life,imageMax, playerPosY)
enemyList[countOfEnemy].setContainers(enemy_containers)
enemyList[countOfEnemy].setImage(Enemy_img[0])
enemyList[countOfEnemy].setImages(Enemy_img)
enemyList[countOfEnemy].setSpritePattern(pathAndKinds[line][4])
enemyList[countOfEnemy].setPos(SCREENRECT.left,(SCREENRECT.bottom/10)*int(pathAndKinds[line][0]))
def DynamicItemAssign(itemList, countOfItem, Item, imageMax, item_containers, Item_img ,pos):
- HowManyZerosAndDigits/임인택 . . . . 33 matches
private HowManyZerosAndDigits object;
object = new HowManyZerosAndDigits(0, 0);
public void testHowManyZeros() {
object = new HowManyZerosAndDigits(0, 0);
assertEquals(0, object.howManyZeros(1));
assertEquals(1, object.howManyZeros(10));
assertEquals(2, object.howManyZeros(100));
assertEquals(2, object.howManyZeros(1010));
// object = new HowManyZerosAndDigits(120, 16);
// object = new HowManyZerosAndDigits(120, 10);
== {{{~cpp HowManyZerosAndDigits.java }}} ==
public class HowManyZerosAndDigits {
public HowManyZerosAndDigits(int n, int b) {
System.out.println(howManyZeros() + " " + numDigit());
public int howManyZeros(long num) {
public int howManyZeros() {
return howManyZeros((long)_fact);
count += howManyZeros(l.longValue());
HowManyZerosAndDigits h = new HowManyZerosAndDigits(n, b);
[HowManyZerosAndDigits]
- ProgrammingWithInterface . . . . 28 matches
상속을 사용하는 상황을 국한 시켜야 할 것같다. 상위 클래스의 기능을 100%로 사용하면서 추가적인 기능을 필요로 하는 객체가 필요할 때! .. 이런 상황일 때는 상속을 사용해도 후풍이 두렵지 않을 것 같다. GoF의 책이나 다른 DP의 책들은 항상 말한다. 상속 보다는 인터페이스를 통해 다형성을 사용하라고... 그 이유를 이제야 알 것같다. 동감하지 않는가? Base 클래스를 수정할 때마다 하위 클래스를 수정해야 하는 상황이 발생한다면 그건 인터페이스를 통해 다형성을 지원하는게 더 낫다는 신호이다. 객체는 언제나 [[SOLID|SRP (Single Responsiblity Principle)]]을 지켜야 한다고 생각한다.
private int topOfStack = 0;
add(topOfStack++, article);
return remove(--topOfStack);
public void pushMany(Object[] articles) {
자 모든 값을 clear 를 사용해 삭제했는데 topOfStack의 값은 여전히 3일 것이다. 자 상속을 통한 문제를 하나 알게 되었다. 상속을 사용하면 원치 않는 상위 클래스의 메소드까지 상속할 수 있다 는 것이다.
private int topOfStack = 0;
theData.add(topOfStack++, article);
return theData.remove(--topOfStack);
public void pushMany(Object [] articles) {
깔끔한 코드가 나왔다. 하지만 MonitorableStack은 pushMany 함수를 상속한다. MonitorableStack을 사용해 pushMany 함수를 호출하면 MonitorableStack의 입력 받은 articles의 articles.length 만큼 push가 호출된다. 하지만 지금 호출된 push 메소드는 MonitorableStack의 것이라는 점! 매번 size() 함수를 호출해 최대 크기를 갱신한다. 속도가 느려질 수도 있다. 그리고 만약 누군가 Stack의 코드를 보고 pushMany 함수의 비 효율성 때문에 Stack을 밑의 코드와 같이 수정했다면 어떻게 될 것인가???
private int topOfStack = -1;
theData[++topOfStack] = article;
Object popped = theData[topOfStack--];
theData[topOfStack] = null;
public void pushMany(Object [] articles) {
assert((topOfStack + articles.length) < theData.length);
System.arraycopy(articles, 0, theData, topOfStack + 1, articles.length);
topOfStack += articles.length;
return topOfStack + 1;
- EightQueenProblem/이선우3 . . . . 24 matches
[[TableOfContents]]
private int sizeOfBoard;
public Board( int sizeOfBoard ) throws Exception
if( sizeOfBoard < 1 ) throw new Exception( Board.class.getName() + "- size_of_board must be greater than 0." );
this.sizeOfBoard = sizeOfBoard;
public int getSizeOfBoard()
return sizeOfBoard;
if( countChessman() == (sizeOfBoard^2) ) return false;
public ConsolBoard( int sizeOfBoard ) throws Exception
super( sizeOfBoard );
for( int i=0; i<getSizeOfBoard(); i++ ) {
for( int j=0; j<getSizeOfBoard(); j++ ) {
if( chessman instanceof Queen ) System.out.print( "Q" );
private int numberOfSolutions;
public void prepareBoard( int sizeOfBoard ) throws Exception
board = new ConsolBoard( sizeOfBoard );
numberOfSolutions = 0;
public int getNumberOfSolutions()
return numberOfSolutions;
if( y == board.getSizeOfBoard() ) {
- Celfin's ACM training . . . . 23 matches
|| 9 || 6 || 110602/10213 || How Many Pieces Of Land? || 3 hours || [http://165.194.17.5/wiki/index.php?url=zeropage&no=4143&title=HowManyPiecesOfLand?/하기웅&login=processing&id=celfin&redirect=yes How Many Pieces Of Land?/Celfin] ||
|| 10 || 6 || 110601/10183 || How Many Fibs? || 2 hours || [http://165.194.17.5/wiki/index.php?url=zeropage&no=4172&title=HowManyFibs?/하기웅&login=processing&id=celfin&redirect=yes How Many Fibs?/Celfin] ||
|| 16 || 13 || 111303/10195 || The Knights of the Round Table || 1 hour || [http://165.194.17.5/wiki/index.php?url=zeropage&no=4263&title=TheKnightsOfTheRoundTable/하기웅&login=processing&id=&redirect=yes TheKnightsOfTheRoundTable/Celfin] ||
|| 24 || 1 || 110105/10267 || Graphical Editor || many days || [Graphical Editor/Celfin] ||
|| 29 || 2 || 110202/10315 || Poker Hands || many days || [PokerHands/Celfin] ||
- SummationOfFourPrimes/1002 . . . . 23 matches
||[[TableOfContents]]||
sizeOfList = len(aList)
for i in range(sizeOfList):
for j in range(sizeOfList):
for k in range(sizeOfList):
for l in range(sizeOfList):
sizeOfList = len(aList)
for i in range(sizeOfList):
for j in range(sizeOfList):
for k in range(sizeOfList):
for l in range(sizeOfList):
스펙상 10000000 값 내에서 4초 이내에 답이 나와야 한다. 이에 대해서 현재의 병목지점에 대해 profiling 을 해 보았다.
C:\WINDOWS\system32\cmd.exe /c python SummationOfFourPrimes.py
1 0.075 0.075 1.201 1.201 summationoffourprimes.py:13(createList)
0 0.000 0.000 profile:0(profiler)
1 5.103 5.103 6.387 6.387 summationoffourprimes.py:88(main)
1 0.000 0.000 1.201 1.201 summationoffourprimes.py:8(__init__)
9999 1.126 0.000 1.126 0.000 summationoffourprimes.py:18(isPrimeNumber)
1 0.000 0.000 0.000 0.000 summationoffourprimes.py:24(getList)
11061 0.083 0.000 0.083 0.000 summationoffourprimes.py:79(selectionFour)
- AustralianVoting/곽세환 . . . . 22 matches
int numberOfCase;
cin >> numberOfCase;
for (tc = 0; tc < numberOfCase; tc++)
int numberOfCandidates;
cin >> numberOfCandidates;
for (i = 0; i < numberOfCandidates; i++)
int numberOfVoters = 0;
votes[numberOfVoters][0] = atoi(strtok(temp, " "));
for (i = 1; i < numberOfCandidates; i++)
votes[numberOfVoters][i] = atoi(strtok(NULL, " "));
numberOfVoters++;
for (i = 0; i < numberOfCandidates; i++)
for (i = 0; i < numberOfVoters; i++)
/*for (i = 0; i < numberOfCandidates; i++)
/*for (i = 0; i < numberOfVoters; i++)
for (i = 0; i < numberOfCandidates; i++)
if (votesPerCandidates[i] > 0.5 * numberOfVoters)
for (i = 0; i < numberOfCandidates; i++)
for (i = 0; i < numberOfCandidates; i++)
for (i = 0; i < numberOfVoters; i++)
- 새싹교실/2012/세싹 . . . . 22 matches
[[TableOfContents]]
* 자세한 해결 방법입니다. 소켓을 생성하고나서 바로 setsockopt(mySocket, SOL_SOCKET, SO_REUSEADDR, &anyIntegerVariableThatContainsNonZero, sizeof(anyIntegerVariableThatContainsNonZero)); 함수를 호출하면 이 소켓의 생명이 다하는 순간 해당 포트에 자리가 나게 됩니다. - [황현]
- 양방향 통신중 한쪽이 off-line상태인 경우에도 메시지의 전송과 수령이 가능하도록
U16 UsaOffset;
U16 AttributeOffset;
U16 NameOffset;
U16 ValueOffset;
U16 NumberOfHeads;
U32 PartitionOffset;
ReadFile(hVolume, &boot_block, sizeof(boot_block), &cnt, 0);
ULARGE_INTEGER offset;
offset.QuadPart = sector * boot_block.BytesPerSector;
overlap.Offset = offset.LowPart;
overlap.OffsetHigh = offset.HighPart;
* http://forensic-proof.com/ 에서 mft에 대해 읽어보시오.
- http://www.codeproject.com/Articles/24415/How-to-read-dump-compare-registry-hives
- http://technet.microsoft.com/en-us/library/cc750583.aspx#XSLTsection124121120120
http://social.msdn.microsoft.com/forums/en-US/Vsexpressvc/thread/560002ab-860f-4cae-bbf4-1f16e3b0c8f4 - [권영기]
ReadFile(hVolume, &boot_block, sizeof(boot_block), &cnt, 0);
// fread((void*)&boot_block,sizeof(boot_block),1,fp);
- RandomWalk/임인택 . . . . 21 matches
[[TableOfContents]]
int board[40][20]; // maximum size of the board is : 40x20
int sizeX, sizeY, xPos, yPos, NumOfBlock, loop=0;
NumOfBlock--;
// prevent the roach moves outside of the board
NumOfBlock--;
if(NumOfBlock==0)
cout << "input size of the board" << endl;
cout << "size is out of range.\ntry again.";
NumOfBlock=sizeX*sizeY;
cout << "point is out of range.\ntry again.";
int NumberOfUnvisitedBlocks = 0, LoopCount= 0 ;
cout << "Size of the board : ";
NumberOfUnvisitedBlocks = sizeX * sizeY;
NumberOfUnvisitedBlocks--;
// prevent the roach moves outside of the board
NumberOfUnvisitedBlocks--;
if(NumberOfUnvisitedBlocks==0)
#define NUMOFDIRECTIONS 8
cout << "Size of the board : ";
- LoadBalancingProblem/Leonardong . . . . 20 matches
self.numOfCPU = 0
for i in range( 1, self.numOfCPU):
def input(self, aNumOfCPU, aEachWorks):
self.numOfCPU = aNumOfCPU
if aID != self.numOfCPU:
assert 0 < aID <= self.numOfCPU
assert 0 < aID <= self.numOfCPU
assert 0 < aID <= self.numOfCPU
for id in range( 1, self.numOfCPU+1 ):
numOfCPU = 3
com.input( numOfCPU, eachWork )
numOfCPU = 3
com.input( numOfCPU, eachWork )
numOfCPU = 8
com.input( numOfCPU, eachWork )
numOfCPU = 10
com.input( numOfCPU, eachWork )
numOfCPU = 10
com.input( numOfCPU, eachWork )
- 새싹교실/2012/startLine . . . . 20 matches
[[TableOfContents]]
void printCalender(int nameOfDay, int year, int month);
// 달의 첫 날의 요일(nameOfDay)과 마지막 날의 수를 받아서 1~endDayOfMonth까지 출력합니다.
void printDate(int nameOfDay, int endDayOfMonth);
void printFirstTab(int nameOfDay);
int calculateNameOfNextMonthFirstDay(int nameOfDay, int year, int month);
int calculateNameOfLastDay(int nameOfDay, int year, int month);
int endDayOfMonth(int year, int month);
// year와 요일(nameOfDay)을 입력받는 부분.
int year = 0, nameOfDay = 0;
printf("Enter the name of day(0:sun ~ 6:sat) : ");
scanf("%d", &nameOfDay);
printCalender(nameOfDay, year, month);
nameOfDay = calculateNameOfNextMonthFirstDay(nameOfDay, year, month);
이런 상황을 피하기 위해서는 처음에 p를 초기화 하고 사용하거나 memset(p.name, 0, sizeof(char)*100);을 하는 방법이 있습니다.
account.name = (char *)malloc(sizeof(char) * (strlen(name)+1));
res = (LinkedList *)malloc( sizeof(LinkedList) );
res = (Node *)malloc( sizeof(Node) );
int onoff = 0; //for duty of switch
onoff = 1;
- HowManyFibs?/황재선 . . . . 19 matches
public int howManyFib(BigInteger start, BigInteger end) {
int howMany = 0;
howMany = 2;
howMany = 1;
howMany++;
return howMany;
public void printNumOfFibs(int numOfFibs) {
System.out.println(numOfFibs);
int numOfFibs = fib.howManyFib(start, end);
fib.printNumOfFibs(numOfFibs);
assertEquals(5, fib.howManyFib(new BigInteger("10"), new BigInteger("100")));
assertEquals(4, fib.howManyFib(new BigInteger("1234567890"),
assertEquals(1, fib.howManyFib(new BigInteger("1"), new BigInteger("1")));
assertEquals(1, fib.howManyFib(new BigInteger("0"), new BigInteger("1")));
[HowManyFibs?]
- EightQueenProblem/이선우 . . . . 18 matches
private int numberOfBoard;
private int sizeOfBoard;
public NQueen( int sizeOfBoard )
this.sizeOfBoard = sizeOfBoard;
board = new int[sizeOfBoard];
numberOfBoard = 0;
for(int i=from; i<sizeOfBoard; i++ ) board[i] = -1;
if( line == sizeOfBoard ) {
numberOfBoard ++;
for( int i=0; i<sizeOfBoard; i++ ) {
for( int i=0; i<sizeOfBoard; i++ ) {
for( int i=0; i<sizeOfBoard; i++ ) {
for( int i=0; i<sizeOfBoard; i++ ) {
for( int j=0; j<sizeOfBoard; j++ ) {
public void printNumberOfBoard()
System.out.println( "Number of different board: " + numberOfBoard );
nq.printNumberOfBoard();
System.out.println( "Usage: java NQueen size_of_queen" );
- MoreEffectiveC++/Techniques1of3 . . . . 17 matches
||[[TableOfContents]]||
== Item 26: Limiting the number of objects of a class ==
class TooManyObjects{}; // 너무 많은 객체를 요구하면
이런 아이디어는 numObject를 사용해서 Printer객체의 수를 제한 시켜 버리는 것이다. 위에도 언급하였듯이 객체의 수가 1개를 초과하면, TooManyObject 예외를 발생시킨다.
throw TooManyObjects();
첫번째 객체 p는 순조로히 생성된다. 하지만 엄연히 다른 프린터를 대상으로 하고 있는 cp는 생성되지 않고, TooManyObjects 예외를 발생 시킨다. 왜 그러는지 모두들 예상 할것이다. 더불어 비슷 또 다른 경우를 생각 해 본다면.
CPFMachine m2; // TooManyObjects 예외를 발생 시킨다.
class TooManyObjects{};
throw TooManyObjects();
class TooManyObjects{};
throw TooManyObjects();
throw TooManyObjects();
class TooManyObjects{}; // 던질 예외
if (numObjects >= maxObjects) throw TooManyObjects();
해당 클래스는 오직 기본 클래스로만 쓰이도록 설계되어 졌다. 그러므로, 생성자와 파괴자가 모두 protected(보호)인자로 설정되어 있다. 그리고 init로서 object-counting을 구현한다. init는 설정된 객체의 숫자가 넘어가면, TooManyObjects 예외 객체를 발생 시킨다.
using Counted<Printer>::TooManyObjects; // 마찬가지~
이는 using이 존재 하지 않았을때 사용된 옛날 문법이다. TooManyObjects 클래스 역시 같은 이유로 using을 이용해서 이름을 사용하게 권한을 열었으며, 이렇게 TooManyObjects를 허용해야 지만 해야지만 클라이언트들이 해당 예외를 잡을 수 있다.
// 그리고 이것은 out-of-memory 예외를 잡을수 있다.
class HeapTracked { // mixin class; keeps track of
=== Construction, Assignment and Destruction of Smart Pointers : 스마트 포인터의 생성, 할당, 파괴 ===
- UDK/2012년스터디/소스 . . . . 16 matches
[[TableOfContents]]
// definition of member variable, assigning value is done at defaultproperties function
local vector CamStart, HitLocation, HitNormal, CamDirX, CamDirY, CamDirZ, CurrentCamOffset;
local float DesiredCameraZOffset;
CurrentCamOffset = self.CamOffset;
DesiredCameraZOffset = (Health > 0) ? - 1.2 * GetCollisionHeight() + Mesh.Translation.Z : 0.f;
CameraZOffset = (fDeltaTime < 0.2) ? - DesiredCameraZOffset * 5 * fDeltaTime + (1 - 5*fDeltaTime) * CameraZOffset : DesiredCameraZOffset;
CurrentCamOffset = vect(0,0,0);
CurrentCamOffset.X = GetCollisionRadius();
CamStart.Z += CameraZOffset;
out_CamLoc = CamStart - CamDirX*CurrentCamOffset.X + CurrentCamOffset.Y*CamDirY + CurrentCamOffset.Z*CamDirZ;
- HowManyPiecesOfLand? . . . . 15 matches
=== About [HowManyPiecesOfLand?] ===
|| 문보창 || C++ || 7시간 || [HowManyPiecesOfLand?/문보창] ||
|| 하기웅 || C++ || 3시간 || [HowManyPiecesOfLand?/하기웅] ||
- TugOfWar/김회영 . . . . 15 matches
int* nWeightOfPeople;
int* rightOfTotal=new int[nCount];
int* leftOfTotal=new int[nCount];
nWeightOfPeople=new int[nPeople];
cin>>nWeightOfPeople[a];
nWeightOfPeople[nPeople-1]=0;
nWeightOfPeople=new int[nPeople];
cin>>nWeightOfPeople[a];
sort(nWeightOfPeople,nPeople);
leftPart[j]=nWeightOfPeople[j];
rightPart[j-nPeople/2]=nWeightOfPeople[j];
leftOfTotal[k]=leftTotal;
rightOfTotal[k]=rightTotal;
cout<<endl<<leftOfTotal[j]<<" "<<rightOfTotal[j];
- TugOfWar/남상협 . . . . 15 matches
= TugOfWar/남상협 =
class TugOfWar:
def solutionOfTwoRemain(self,numbers):
def solutionOfOddNumber(self,numbers):
self.solutionOfOddNumber(numbers)
self.solutionOfTwoRemain(numbers)
self.solutionOfOddNumber(numbers)
class testTugOfWar(unittest.TestCase):
self.exTugOfWar=TugOfWar()
self.assertEqual([190,200],self.exTugOfWar.coupling(self.d1))
self.assertEqual([175,180],self.exTugOfWar.coupling(self.d2))
self.assertEqual([138,139],self.exTugOfWar.coupling(self.d3))
self.assertEqual([12,12],self.exTugOfWar.coupling(self.d4))
self.assertEqual([150,250],self.exTugOfWar.coupling(self.d5))
- MineSweeper/김회영 . . . . 13 matches
int* arrayOfMine=new int[width*height];
arrayOfMine[a*width+b]=0;
arrayOfMine[(i-1)*width+(j-1)]++;
arrayOfMine[(i)*width+(j-1)]++;
arrayOfMine[(i+1)*width+(j-1)]++;
arrayOfMine[(i-1)*width+(j)]++;
arrayOfMine[(i+1)*width+(j)]++;
arrayOfMine[(i-1)*width+(j+1)]++;
arrayOfMine[(i)*width+(j+1)]++;
arrayOfMine[(i+1)*width+(j+1)]++;
arrayOfMine[i*width+j]=BOMB;
if(arrayOfMine[y*width+x]>=BOMB)
cout<<arrayOfMine[y*width+x];
- TheTrip/Leonardong . . . . 13 matches
def getListOfBiggerThan(self, aMean, aList):
def getMeanOfList(self, aList):
def offerAShareOfMoney(self, aExpenses):
expensesBiggerThanMean = self.getListOfBiggerThan(
self.getMeanOfList(aExpenses),
result = result + abs( each - self.getMeanOfList(aExpenses) )
def testGetListOfBiggerThan(self):
mean = self.ex.getMeanOfList(expenses) # mean is 1.5
self.ex.getListOfBiggerThan( mean, expenses ))
def testOfferAShareOfMoney(self):
self.ex.offerAShareOfMoney( [10.0, 20.0, 30.0] ))
self.ex.offerAShareOfMoney( [15.0, 15.01, 3.0, 3.01] ))
- Gof/Singleton . . . . 12 matches
[[TableOfContents]]
더욱더 유연한 접근 방법으로 '''registry of singletons''' 이 있다. 가능한 Singleton class들의 집합을 정의하는 Instance operation을 가지는 것 대신, Singleton class들을 잘 알려진 registry 에 그들의 singleton instance를 등록하는 것이다.
CList <CNSingleton*, CNSingleton*>* m_ContainerOfSingleton;
delete m_ContainerOfSingleton;
m_ContainerOfSingleton = new CList <CNSingleton*, CNSingleton*>;
m_ContainerOfSingleton->AddTail(new CNSingleton());
POSITION position = m_ContainerOfSingleton->GetHeadPosition();
delete m_ContainerOfSingleton->GetAt(position);
m_ContainerOfSingleton->GetNext(position);
m_ContainerOfSingleton->RemoveAll();
if (m_Index == m_ContainerOfSingleton->GetCount())
POSITION position = m_ContainerOfSingleton->FindIndex(m_Index);
return m_ContainerOfSingleton->GetAt(position);
- JollyJumpers/강희경 . . . . 12 matches
int GetSumOfGoalGap(int aN);
int numberOfInputFactor;
if(cin >> numberOfInputFactor){
inputedList = new int[numberOfInputFactor+1];
inputedList[0] = numberOfInputFactor;
if(numberOfInputFactor < 2){
numberOfInputFactor = 0;
numberOfInputFactor = 0;
if(!(cin >> inputedList[inputedList[0] - numberOfInputFactor])){
numberOfInputFactor = 0;
numberOfInputFactor--;
}while(numberOfInputFactor >= 0);
- EightQueenProblem/이선우2 . . . . 11 matches
private int numberOfAnswers;
numberOfAnswers = -1;
if( out != null || numberOfAnswers == -1 ) {
return numberOfAnswers;
numberOfAnswers = -1;
numberOfAnswers = 0;
numberOfAnswers ++;
if( checkOne && numberOfAnswers > 0 ) break;
int sizeOfBoard = 0;
sizeOfBoard = Integer.parseInt( args[0] );
NQueen2 nq = new NQueen2( sizeOfBoard );
System.out.println( "number of answers: " + nq.countAnswers());
System.out.println( "number of answers: " + nq.countAnswers( System.out ));
System.out.println( "number of answers: " + nq.countAnswers( System.out ));
- HanoiTowerTroublesAgain!/황재선 . . . . 11 matches
public int maxBall(int numOfPeg) {
int[] prevNumber = new int[numOfPeg + 1];
for(int peg = 1; peg <= numOfPeg; peg++) {
public void printNumberOfBall(int numOfBall) {
System.out.println(numOfBall);
int numOfPeg = hanoi.readNumber();
int numOfBall = hanoi.maxBall(numOfPeg);
hanoi.printNumberOfBall(numOfBall);
- JSP/FileUpload . . . . 11 matches
if ((contentType != null) && (contentType.indexOf("multipart/form-data") >= 0))
String saveFile = file.substring(file.indexOf("filename="") + 10);
saveFile = saveFile.substring(0, saveFile.indexOf("\n"));
saveFile = saveFile.substring(saveFile.lastIndexOf("\") + 1,saveFile.indexOf("""));
int lastIndex = contentType.lastIndexOf("=");
pos = file.indexOf("filename="");
pos = file.indexOf("\n", pos) + 1;
pos = file.indexOf("\n", pos) + 1;
pos = file.indexOf("\n", pos) + 1;
int boundaryLocation = file.indexOf(boundary, pos) - 4;
- MoinMoinFaq . . . . 11 matches
[[TableOfContents]]
The term ''Wiki'' is a shortened form of Wiki''''''Wiki''''''Web. A Wiki
is a database of pages that can be collaboritively edited using a web
very many pages, which describe various projects, architectures,
=== What are the major features of a Wiki? ===
=== How does this compare to other collaboration tools, like Notes? ===
feature is some kind of access control, to allow only certain groups
'''NO''' security. (That's right!) Because of this, the
of part of all of the wiki.
difficult, because there is a change log (and back versions) of every page
particular comment, or someone can change the content of a paragraph to
In other words, the philosophy of wiki is one of dealing manually with the
rare (exception) case of a saboteur, rather than designing in features
==== How can I search the wiki? ====
* Click on TitleIndex. This will show you an alphabetized list
of all pages by title.
* Click on WordIndex. This shows an alphabetized list of every
* Click on {{{~cpp LikePages}}} at the bottom of the page. This shows pages
* Click on the page title at the very top of the page. This
shows what pages link to the current page (which may help you
- SolarSystem/상협 . . . . 11 matches
// Calculate The Aspect Ratio Of The Window
void CorrectOfCoordinate(float distance,float x,float y, float z)
CorrectOfCoordinate(distance2,1.0f,1.0f,0.0f);
CorrectOfCoordinate(distance3,1.0f,1.0f,0.0f);
CorrectOfCoordinate(distance4,0.1f,1.2f,0.0f);
CorrectOfCoordinate(distance5,0.07f,0.06f,0.0f);
CorrectOfCoordinate(distance6,0.0f,1.0f,0.0f);
CorrectOfCoordinate(distance7,0.7f,1.0f,0.0f);
CorrectOfCoordinate(distance8,0.1f,1.0f,0.0f);
CorrectOfCoordinate(distance2,0.3f,1.0f,0.0f);
ShowCursor(TRUE);
MessageBox(NULL,"Release Of DC And RC Failed.","SHUTDOWN ERROR",
memset(&dmScreenSettings,0,sizeof(dmScreenSettings));
ShowCursor(FALSE);
sizeof(PIXELFORMATDESCRIPTOR),
ShowWindow(hWnd,SW_SHOW);
int nCmdShow)
- HowManyFibs? . . . . 10 matches
=== About [HowManyFibs?] ===
|| 황재선 || Java || 1h || [HowManyFibs?/황재선] ||
|| 문보창 || C++ || 2h || [HowManyFibs?/문보창] ||
|| [1002] || Python || 1차: 3시간(실패), 2차: 10분 || [HowManyFibs?/1002] ||
|| 하기웅 || C++ || 2h || [HowManyFibs?/하기웅] ||
- HowManyZerosAndDigits . . . . 10 matches
== About[HowManyZerosAndDigits] ==
|| [문보창] || C++ || ? || [HowManyZerosAndDigits/문보창] ||
|| [임인택] || Java || ? || [HowManyZerosAndDigits/임인택] [[BR]] 주의 : 일단 10진법 이상의 진법도 10진수로 표현한다고 가정하고 문제를 풀었음 [[BR]] (예를 들어 A0 대신 10 0 이라고 표현한다고 가정) ||
|| [김회영] || C++ || ? || [HowManyZerosAndDigits/김회영] ||
|| [허아영] || C++ || 1시간 30분 || [HowManyZerosAndDigits/허아영] ||
- LoadBalancingProblem/임인택 . . . . 10 matches
* To enable and disable the creation of type comments go to
* To enable and disable the creation of type comments go to
public void testGetSumOfJob() {
assertEquals(bal.getSumOfJob(), 8);
* To enable and disable the creation of type comments go to
public int getSumOfJob() {
int sum = getSumOfJob();
int average = getSumOfJob() / _processor.length;
int remian = getSumOfJob() % _processor.length;
rightSum = getSumOfJob() - leftSum;
int average = getSumOfJob() / _processor.length;
int remian = getSumOfJob() % _processor.length;
rightSum = getSumOfJob() - leftSum;
- 경시대회준비반 . . . . 10 matches
|| [HowManyFibs?] ||
|| [HowManyPiecesOfLand?] ||
|| [TowerOfCubes] ||
|| [TheKnightsOfTheRoundTable] ||
|| [HowBigIsIt?] ||
|| [TreesOnMyIsland] ||
- 문자반대출력/최경현 . . . . 10 matches
int numberOfString;
numberOfString = strlen(string);
for (int i = 0; i < numberOfString; i++)
if(numberOfString%2==0)
for(i=1;i<numberOfString/2+1;i++)
broker = string[numberOfString-i];
string[numberOfString-i] = string[i-1];
for(i=1;i<numberOfString/2+2;i++)
broker = string[numberOfString-i];
string[numberOfString-i] = string[i-1];
- 2002년도ACM문제샘플풀이/문제A . . . . 9 matches
[[TableOfContents]]
int numOfData;
cin >> numOfData;
for(int i=0;i<numOfData;i++)
for(int i=0;i<numOfData;i++) {
for(int i=0;i<numOfData;i++)
int numberOfTestCase =0;
cin >> numberOfTestCase;
for ( int testCaseNum=0;testCaseNum<numberOfTestCase;testCaseNum++){
- EcologicalBinPacking/강희경 . . . . 9 matches
[[TableOfContents]]
#define NumberOfSlots 9
#define NumberOfCases 6
#define NumberOfResultInformations 2
int* slots = new int[NumberOfSlots + 1];
for(int i = 0; i < NumberOfSlots; i++)
int* noMove = new int[NumberOfCases];
for(int i = 0; i < NumberOfCases; i++)
int *resultInformation = new int[NumberOfResultInformations];
- MobileJavaStudy/NineNine . . . . 9 matches
dan[i-2] = String.valueOf(i) + " dan";
form = new Form(String.valueOf(dan)+" dan");
str += String.valueOf(dan)+" * "+i+" = "+String.valueOf(dan*i)+"\n";
nineDanList.append(String.valueOf(i) + " dan", null);
danForm = new Form(String.valueOf(dan) + " dan");
danForm.append(String.valueOf(dan) + " * " + String.valueOf(i)
+ " = " + String.valueOf(dan * i) + "\n");
- MoreEffectiveC++/Basic . . . . 9 matches
|| [[TableOfContents]] ||
'''*(array+ ( i *sizeof(an object in the array) )''' [[BR]]
for( int i = the number of elements in the array -1; i>0; --i)
* '''첫번째 문제는 해당 클래스를 이용하여 배열을 생성 할때이다. . ( The first is the creation of arrays )'''
EquipmentPiece bestPieces[10];
EquipmentPiece bestPieces = new EquipmentPiece[10];
PEP bestPieces[10];
PEP *bestPieces = new PEP[10];
void *rawMemory = operator new[](10*sizeof(EquipmentPiece));
EquipmentPiece *bestPieces = static_cast<EquipmentPiece*>(rawMemory);
new (bestPieces+1) EquipmentPiece ( ID Number ); // 이건 placement new 라고 하여 Item 8 에서 언급한다.
bestPieces[i].~EquipmentPiece(); // 언제나 느끼는 거지만 C++을 방종을 가져다 줄수 있다.
delete [] bestPieces; // 이렇게 지우는건 new operator가 건들지 않아서 불가능하다.
- PrimaryArithmetic/Leonardong . . . . 9 matches
def getValueOfDegree( num, degree ):
count += carry( getValueOfDegree( n, degree ),
getValueOfDegree( m, degree ),
return carry( getValueOfDegree( n, degree/10 ), getValueOfDegree( m, degree/10 ), getCarry(n, m, degree/10) )
def testGetValueOfDegree(self):
self.assertEquals( 0, getValueOfDegree( 0, 1 ) )
self.assertEquals( 2, getValueOfDegree( 1234, 100 ) )
self.assertEquals( 0, getValueOfDegree( 1, 10 ) )
- TugOfWar . . . . 9 matches
=== About TugOfWar ===
worst case(입력자료 크기로만) 입력은 TugOfWarInput 참조
|| [상협] || Python || 3시간 || [TugOfWar/남상협] ||
|| 신재동 || Python || 14분 || [TugOfWar/신재동] ||
|| [강희경] || Python || 2일 || [TugOfWar/강희경] ||
|| [김회영] || C || 4시간 || [TugOfWar/김회영] ||
|| JuNe || Python || 1시간 || Seminar:TugOfWar/JuNe ||
|| [이승한] || C || 오래. || [TugOfWar/이승한] ||
|| [문보창] || C++ || . || [TugOfWar/문보창] ||
- 고한종/on-off를조절할수있는코드 . . . . 9 matches
int onOff;
char keyOnOff;
onOff=1;
while(onOff)
keyOnOff=getch();
//이 부분은 scanf_s("%c",&keyOnOff);로도 쓸 수 있지만 scanf_s와 scanf의 차이도 잘 모르고 scanf는 사실 매우 어려운 함수;
switch(keyOnOff)
onOff=1;
onOff=0;
- 새싹교실/2011/AmazingC/과제방 . . . . 9 matches
int rows,stars,blank,numberOfBlanks=0;
numberOfBlanks=2*rows-1;
for(stars=0;stars<(13-numberOfBlanks)/2;stars++) printf("*");
for(blank=0;blank<numberOfBlanks;blank++) printf(" ");
for(stars=0;stars<(13-numberOfBlanks)/2;stars++) printf("*");
numberOfBlanks=2*(6-(rows-6))-1;
for(stars=0;stars<(13-numberOfBlanks)/2;stars++) printf("*");
for(blank=0;blank<numberOfBlanks;blank++) printf(" ");
for(stars=0;stars<(13-numberOfBlanks)/2;stars++) printf("*");
- 1002/Journal . . . . 8 matches
* 사람수대로 retrofitting 인쇄하기 -> 6부 인쇄하기 - O
* Retrofitting UT 발표준비
~ 11 : 20 retrofitting 인쇄
~ 1 : 06 retrofitting 공부 & 이해
~ 2 : 42 (지하철) retrofitting 읽기 & 이해
읽기 준비 전 Seminar:ThePsychologyOfComputerProgramming 이 어려울 것이라는 생각이 먼저 들어서, 일단 영어에 익숙해져야겠다는 생각이 들어서 Alice in wonderland 의 chapter 3,4 를 들었다. 단어들이 하나하나 들리는 정도. 아직 전체의 문장이 머릿속으로 만들어지진 않는 것 같다. 단어 단위 받아쓰기는 가능하지만, 문장단위 받아쓰기는 힘든중.
도서관에서 이전에 절반정도 읽은 적이 있는 Learning, Creating, and Using Knowledge 의 일부를 읽어보고, NoSmok:HowToReadaBook 원서를 찾아보았다. 대강 읽어봤는데, 전에 한글용어로는 약간 어색하게 느껴졌던 용어들이 머릿속에 제대로 들어왔다. (또는, 내가 영어로 된 책을 읽을때엔 전공책의 그 어투를 떠올려서일런지도 모르겠다. 즉, 영어로 된 책은 약간 더 무겁게 읽는다고 할까. 그림이 그려져 있는 책 (ex : NoSmok:AreYourLightsOn, 캘빈 & 홉스) 는 예외)
책을 읽으면서 '해석이 안되는 문장' 을 그냥 넘어가버렸다. 즉, NoSmok:HowToReadaBook 에서의 첫번째 단계를 아직 제대로 못하고 있는 것이다. 그러한 상황에서는 Analyicial Reading 을 할 수가 없다.
* GOF 번역을 할때엔? - 번역을 할때엔 애매한 단어들에 대해 전부 사전을 찾아보게 된다. (완전히 직역을 하므로) 시간이 많이 걸리지만, 영어학습 초기엔 자주 해보는게 좋지 않을까 생각한다. (꼭 한글 번역이 아닌, 어려운 영어에 대한 쉬운 영어로의 해설. 이게 좀 더 어려우려나..)
* 그렇다면, 어떻게 NoSmok:HowToReadaBook 이나 'Learning, Creating, and Using Knowledge' 은 읽기 쉬웠을까?
* 사전지식이 이미 있었기 때문이라고 판단한다. NoSmok:HowToReadaBook 는 한글 서적을 이미 읽었었고, 'Learning, Creating, and Using Knowledge' 의 경우 Concept Map 에 대한 이해가 있었다. PowerReading 의 경우 원래 표현 자체가 쉽다.
* 처음 프로그래밍을 접하는 사람에게는 전체 프로젝트 과정을 이해할 수 있는 하루를, (이건 RT 보단 밤새기 프로젝트 하루짜리를 같이 해보는게 좋을 것 같다.) 2-3학년때는 중요 논문이나 소프트웨어 페러다임 또는 양서라 불리는 책들 (How To Read a Book, 이성의 기능, Mind Map 이나 Concept Map 등)을 같이 읽고 적용해보는 것도 좋을것 같다.
* Instead of being tentative, begin learning concretely as quickly as possible.
* Instead of clamming up, communicate more clearly.
* Instead of avoding feedback, search out helpful, concrete feedback.
사실 {{{~cpp LoD}}} 관점에서 보면 자기가 만든 객체에는 메세지를 보내도 된다. 하지만 세밀한 테스트를 하려면 좀더 엄격한 룰을 적용해야할 필요를 느끼기도 한다. 니가 말하는 걸 Inversion of Control이라고 한다. 그런데 그렇게 Constructor에 parameter로 계속 전달해 주기를 하다보면 parameter list가 길어지기도 하고, 각 parameter간에 cohesion과 consistency가 떨어지기도 한다. 별 상관없어 보이는 리스트가 되는 것이지.
어제 간만에 교보에 들려 Alice in wonderland 와 Dr.Jekyll & Mr.Hyde 오디오 북을 샀다. 교보쪽 외국어 분야쪽이 비교적 정리가 잘 되어있는 듯 하다. 다음에도 종종 들려야겠다.
Alice in wonderland 의 경우 여자성우가 읽어준다. 이전에 들었던 Sherlock Holmes 의 경우에 익숙해져여서인지, 발음속도가 느림에도 불구하고 이해도가 떨어졌다. 이전에는 그냥 듣고 머릿속에서 문장을 그린다음 이해하는 방식으로 했는데, 이번에는 받아쓰기 연습을 해봐야겠다.
이전에 Alice in wonderland 책이 있었지만 제대로 이해를 잘 못했었는데, 개인적으로 영어수준이 딸리는것에 대해 그냥 문제상황으로만 놓은것이 잘못인것 같다. 문제를 문제로 인식하지 않고, 깨닫음으로 인식하도록 노력하는것은 잊어버리기 쉽다. 이번에는 '더 쉬운 자료를 찾는다'라는 방법이 떠올라서 다행이다.
http://www.utdallas.edu/~chung/patterns/conceptual_integrity.doc - Design Patterns as a Path to Conceptual Integrity 라는 글과 그 글과 관련, Design Patterns As Litmus Paper To Test The Strength Of Object Oriented Methods 라는 글을 보게 되었는데, http://www.econ.kuleuven.ac.be/tew/academic/infosys/Members/Snoeck/litmus2.ps 이다. 디자인패턴의 생성성과 관련, RDD 와 EDD 가 언급이 되는 듯 하다.
- TheGrandDinner/조현태 . . . . 8 matches
int numberOfTable = 0;
int numberOfTeam = 0;
sscanf(readData, "%d %d", &numberOfTeam, &numberOfTable);
if (0 == numberOfTeam && 0 == numberOfTable)
for (register int i = 0; i < numberOfTeam; ++i)
for (register int i = 0; i < numberOfTable; ++i)
- 고한종/배열을이용한구구단과제 . . . . 8 matches
int onOff;
char keyOnOff;
onOff=1;
while(onOff)
keyOnOff=getch();
switch(keyOnOff)
onOff=1;
onOff=0;
// 괜히 화려해 보일려고 on/off 코드 집어 넣었음요.
while ((c=getchar()) != EOF && c != '\n');
- 인수/Smalltalk . . . . 8 matches
Transcript cr; show: a; show: ' * '; show: b; show: ' = '; show: a*b; printString.
numsOfWalked := Array2D width:size height:size.
numsOfWalked atAllPut:0.
numsOfWalked do: [ :val | val = 0 ifTrue: [^false] ].
| numOfWalked |
numOfWalked _ numsOfWalked at: aRow at: aCol.
numsOfWalked at: aRow at:aCol put: numOfWalked + 1.
- 2002년도ACM문제샘플풀이/문제C . . . . 7 matches
int numberOfData;
cin >> numberOfData;
inputData = new InputData[numberOfData];
outputData = new bool[numberOfData];
for(int i = 0;i < numberOfData;i++)
for(int i =0;i < numberOfData;i++) {
for(int i = 0;i < numberOfData;i++)
Means Ends Analysis라고 하는데 일반적인 문제 해결 기법 중 하나다. 하노이 탑 문제가 전형적인 예로 사용되지. 인지심리학 개론 서적을 찾아보면 잘 나와있다. 1975년도에 튜링상을 받은 앨런 뉴엘과 허버트 사이먼(''The Sciences of the Artificial''의 저자)이 정립했지. --JuNe
- ClassifyByAnagram/인수 . . . . 7 matches
|| [[TableOfContents]] ||
MCI howManyEachAlphabet;
howManyEachAlphabet[ str[i] ] += 1;
_anagramTable[str] = howManyEachAlphabet;
void Show()
while(!fin.eof())
anagram.Show();
MCI howManyEachAlphabet;
howManyEachAlphabet[ str[i] ] += 1;
return howManyEachAlphabet;
while(!fin.eof())
void ShowAnagram()
ana.ShowAnagram();
- DPSCChapter1 . . . . 7 matches
[[TableOfContents]]
Welcome to ''The Design Patterns Smalltalk Companion'' , a companion volume to ''Design Patterns Elements of Reusable Object-Oriented Software'' by Erich Gamma, Richard Helm, Ralph Johnson, and Jogn Vlissides(Gamma, 1995). While the earlier book was not the first publication on design patterns, it has fostered a minor revolution in the software engineering world.Designers are now speaking in the language of design patterns, and we have seen a proliferation of workshops, publications, and World Wide Web sites concerning design patterns. Design patterns are now a dominant theme in object-oriented programming research and development, and a new design patterns community has emerged.
''The Design Patterns Smalltalk Companion'' 의 세계에 오신걸 환영합니다. 이 책은 ''Design Patterns Elements of Reusable Object-Oriented Software''(이하 DP) Erich Gamma, Richard Helm, Ralph Johnson, and Jogn Vlissides(Gamma, 1995). 의 편람(companion, 보기에 편리하도록 간명하게 만든 책) 입니다. 앞서 출간된 책(DP)이 디자인 패턴에 관련한 책에 최초의 책은 아니지만, DP는 소프트웨어 엔지니어링의 세계에 작은 혁명을 일으켰습니다. 이제 디자이너들은 디자인 패턴의 언어로 이야기 하며, 우리는 디자인 패턴과 관련한 수많은 workshop, 출판물, 그리고 웹사이트들이 폭팔적으로 늘어나는걸 보아왔습니다. 디자인 패턴은 객체지향 프로그래밍의 연구와 개발에 있어서 중요한 위치를 가지며, 그에 따라 새로운 디자인 패턴 커뮤니티들이 등장하고 있습니다.(emerge 를 come up or out into view 또는 come to light 정도로 해석하는게 맞지 않을까. ''이제 디자인 패턴은 객체지향 프로그래밍의 연구와 개발에 있어서 중요한 위치를 가지고 있으며, 디자인 패턴 커뮤니티들이 새로이 등장하고 있는 추세입니다.'' 그래도 좀 어색하군. -_-; -- 석천 바꿔봤는데 어때? -상민 -- DeleteMe)gogo..~ 나중에 정리시 현재 부연 붙은 글 삭제하던지, 따로 밑에 빼놓도록 합시다.
''Design Patterns'' describes 23 design patterns for applications implemented in an object-oriented programming language. Of course, these 23 patterns do not capture ''all'' the design knowledge an object-oriented designer will ever need. Nonetheless, the patterns from the "Gang of Four"(Gamma et al.) are a well-founded starting point. They are a design-level analog to the base class libraries found in Smalltalk development environments. They do not solve all problems but provide a foundation for learning environments. They do not solve all problems but provide a foundation for learning about design patterns in general and finding specific useful architectures that can be incorporated into the solutions for a wide variety of real-world design problems. They capture an expert level of design knowledge and provide the foundation required for building elegant, maintainable, extensible object-oriented programs.
''디자인 패턴''은 객체지향 언어로 제작된 프로그램에 23개의 패턴을 제시합니다. 물론, 23개의 패턴이 객체지향 디자이너들이 필요로 할 모든 디자인의 난제들을 전부 잡아내지는 못합니다. 그럼에도 불구하고 "Gang of Four"(Gamma et al.)에서 제시한 23개의 패턴은 좋은 디자인의 든든한 출발을 보장합니다. 이 23개의 패턴은 Smalltalk class libraries에 기반을한 디자인 수준(design-level) 분석(analog)입니다. 이 패턴을 이용해서 모든 문제를 해결할 수는 없지만, 전반적이고, 실제 디자인의 다양한 문제들을 위한 해결책을 위한 유용한 지식들의 기반을 제공할것입니다. 또, 이 패턴을 통해서 전문가 수준의 디자인 지식을 취득하고, 우아하고, 사후 관리가 편하고, 확장하기 쉬운 객체지향 프로그램 개발에 기초 지식을 제공하는데 톡톡한 역할을 할것입니다.
In the Smalltalk Companion, we do not add to this "base library" of patterns;rather, we present them for the Smalltalk designer and programmer, at times interpreting and expanding on the patterns where this special perspective demands it. Our goal is not to replace Design Patterns; you should read the Smalltalk Companion with Design Patterns, not instead of it. We have tried not to repeat information that is already well documented by the Gang of Four book. Instead, we refer to it requently;you should too.
우리는 Gang of Four 책에서 이미 잘 문서화된 정보는 반복해서 공부하지 않는다. 대신, 우리는 자주 그것을 참조해야한다. 여러분 또한 그렇게 해야한다.
''Smalltalk Companion에서, 우리는 패턴의 'base library'를 추가하지 않습니다. 그것보다, 우리는 base library들을 Smalltalk 의 관점에서 해석하고 때?灌? 확장하여 Smalltalk 디자이너와 프로그래머를 위해 제공할 것입니다. 우리의 목표는 '''Design Patterns'''을 대체하려는 것이 아닙니다. '''Design Patterns''' 대신 Smalltalk Companion을 읽으려 하지 마시고, 두 책을 같이 읽으십시오. 우리는 이미 Gang of Four에서 잘 문서화된 정보를 반복하지 않을겁니다. 대신, 우리는 GoF를 자주 참조할 것이고, 독자들 역시 그래야 할 것입니다. -- 문체를 위에거랑 맞춰봤음.. 석천''
Learning an object-oriented language after programming in another paradigm, such as the traditional procedural style, is difficult. Learning to program and compose application in Smalltalk requires a complex set of new skills and new ways of thinking about problems(e.g Rosson & Carroll, 1990; Singley, & Alpert, 1991). Climbing the "Smalltalk Mountain" learning curve is cetainly nontrivial. Once you have reached that plateau where you feel comfortable building simple Smalltalk applications, there is still a significant distance to the expert peak.
Smalltalk experts know many things that novices do not, at various abstraction levels and across a wide spectrum of programming and design knowledge and skills:
* The low-level details of the syntax and semantics of the Smalltalk language
* What is available in the form of classes, methods, and functionality in the existing base class libraries
* How to use the specific tools of the Smalltalk interactive development environment to find and reuse existing functionality for new problems, as well as understanding programs from both static and runtime perspective
* How to define and implement behavior in new classes and where these classes ought to reside in the existing class hierarchy
* Recurring patterns of object configurations and interactions and the sorts of problems for which these cooperating objects provide (at least partial) solutions
This is by no means an exhaustive list, and even novices understand and use much of the knowledge. But some items, especially the last -- recurring patterns of software design, or design patterns -- are the province of design expert.
A '''design pattern''' is a reusable implementation model or architecture that can be applied to solve a particular recurring class of problem. The pattern sometimes describes how methods in a single class or subhierarchy of classes work together; more often, it shows how multiple classes and their instances collaborate. It turns out that particular architectures reappear in different applications and systems to the extent that a generic pattern template emerges, one that experts reapply and customize to new application - and domain-specific problems. Hence, experts know how to apply design patterns to new problems to implement elegant and extensible solutions.
In general, designers -- in numerous domains, not just software -- apply their experience with past problems and solution to new, similar problems. As Duego and Benson(1996) point out, expert designers apply what is known in cognitive psychology and artificial intelligence as '''case-based reasoning''', remembering past cases and applying what they learned there. This is the sort of reasoning that chess masters, doctors, lawyers, and architects empoly to solve new problems. Now, design patterns allow software designers to learn from and apply the experiences of other designers as well. As in other domains, a literature of proven patterns has emerged. As a result, we can "stand on the shoulders of giants" to get us closer to the expert peak. As John Vlissies (1997) asserts, design patterns "capture expertise and make it accessible to non-experts" (p. 32).
Design patterns also provide a succinct vocabulary with which to describe new designs and retrospectively explain existing ones. Patterns let us understand a design at a high level before drilling down to focus on details. They allow us to envision entire configurations of objects and classes at a large grain size and communicate these ideas to other designers by name. We can say, "Implement the database access object as a Singleton," rather than, "Let's make sure the database access class has just one instance. The class should include a class variable to keep track of the singl instance. The class should make the instance globally available but control access to it. The class should control when the instance is created and ..." Which would you prefer?
Christopher Alexander and his colleagues have written extensively on the use of design patterns for living and working spaces-homes, buildings, communal areas, towns. Their work is considered the inspiration for the notion of software design patterns. In ''The Timeless Way of Building''(1979) Alexander asserts, "Sometimes there are version of the same pattern, slightly different, in different cultures" (p.276). C++ and Smalltalk are different languages, different environments, different cultures-although the same basic pattern may be viable in both languages, each culture may give rise to different versions.
- JTDStudy/첫번째과제/상욱 . . . . 7 matches
// show score
JOptionPane.showMessageDialog(null, checkScore());
return userNumber = JOptionPane.showInputDialog(null, "Enter number what you think");
int numOfStrike = 0;
int numOfBall = 0;
numOfStrike++;
numOfBall++;
if (numOfStrike == 3)
return "" + numOfStrike + " Strike, " + numOfBall + " Ball";
def Show(sbo,count, end=True):
Show(sbo,count,isEnd)
- RandomWalk/영동 . . . . 7 matches
[[TableOfContents]]
void showBoard(int a_board[][MAX_X], int length_x, int length_y);
void askLocationOfBug(Bug & a_bug);
askLocationOfBug(bug);
showBoard(board, MAX_X, MAX_Y);
void showBoard(int a_board[][MAX_X], int length_x, int length_y)
void askLocationOfBug(Bug & a_bug)
void showBoard();
void askLocationOfBug();
void Board::showBoard()
void Bug::askLocationOfBug()
bug.askLocationOfBug();
board.showBoard();
- Refactoring/ComposingMethods . . . . 7 matches
[[TableOfContents]]
* You have a code fragment that can be grouped together.[[BR]]''Turn the fragment into a method whose name explains the purpose of the method.''
* A method's body is just as clear as its name. [[BR]] ''Put the method's body into the body of its callers and remove the method.''
return _numberOfLateDeliveries > 5;
return (_numberOfLateDeliveries>5)?2:1;
* You have a temp that is assigned to once twith a simple expression, and the temp is getting in the way of other refactorings. [[BR]] ''Replace all references to that temp with the expression.''
* You have a complicated expression. [[BR]] ''Put the result of the expression, or parts of the expression,in a temporary variagle with a name that explains the purpose.''
if ( (platform.toUpperCase().indexOf("MAC") > -1) &&
(browser.toUpperCase().indexOf("IE") > -1) &&
final boolean isMacOs = platform.toUpperCase().indexOf("MAX") > -1;
final boolean isIEBrowser = browser.toUpperCase().indexOf("IE") > -1);
* You want to replace an altorithm with one that is clearer. [[BR]] ''Replace the body of the method with the new altorithm.''
- ReverseAndAdd/김회영 . . . . 7 matches
int arrayOfDigit[10];
arrayOfDigit[++count]=num%10;
returnValue+=arrayOfDigit[i]*pow(10,count-i);
int arrayOfDigit[10];
arrayOfDigit[++count]=num%10;
while(arrayOfDigit[i]==arrayOfDigit[j])
- SmithNumbers/신재동 . . . . 7 matches
int sumPositionOfNumber(int testNumber);
int sumFactorizationOfNumber(int testNumber);
int sumPositionOfNumber(int testNumber)
int sumFactorizationOfNumber(int testNumber)
sum += sumPositionOfNumber(prime);
return sumPositionOfNumber(testNumber) == sumFactorizationOfNumber(testNumber);
- TableOfContentsMacro . . . . 7 matches
[[TableOfContents]]
[[TableOfContents]]
TableOfContentsMacro를 페이지의 상단에 {{{[[TableOfContents]]}}} 와 같이 넣으면,
* TableOfContentsMacro를 쓰지 않으면 제목줄에 번호가 붙지 않고, 이 매크로를 쓰면 제목에 번호가 붙습니다.
* ''toggle'' : 목차를 보여주거나 감출 수 있게 한다. {{{[[TableOfContents(toggle)]]}}}
* ''title'' : 목차의 제목을 다르게 바꿀 수 있다. {{{[[TableOfContents(title=차례)]]}}}
- whiteblue/만년달력 . . . . 7 matches
void calanderoutput();
int lastDayOfMonth[12] = {31,29,31,30,31,30,31,31,30,31,30,31};
int yearInput, monthInput, count = 0, dateNumber = 1 , locationOf1stDay, addm;
locationOf1stDay = (addm + yearInput + count - 1 + 6) % 7; //
locationOf1stDay++;
locationOf1stDay = (addm + yearInput + count + 6 ) % 7; //
calanderoutput();
void calanderoutput() // 달력의 출력
if ( (j == 1 && k < locationOf1stDay) ||
dateNumber > lastDayOfMonth[monthInput-1] ||
- 데블스캠프2011/다섯째날/HowToWriteCodeWell . . . . 7 matches
* [데블스캠프2011/다섯째날/How To Write Code Well/송지원, 성화수]
* [데블스캠프2011/다섯째날/How To Write Code Well/권순의, 김호동]
* [데블스캠프2011/다섯째날/How To Write Code Well/김준석, 서영주]
* [데블스캠프2011/다섯째날/How To Write Code Well/정의정, 김태진]
* [데블스캠프2011/다섯째날/How To Write Code Well/임상현, 서민관]
* [데블스캠프2011/다섯째날/How To Write Code Well/강소현, 구자경]
* [데블스캠프2011/다섯째날/How To Write Code Well/박정근, 김수경]
- 스네이크바이트/C++ . . . . 7 matches
[[TableOfContents]]
const int numberOfStudent = 10;//학생 수
student stu[numberOfStudent] =
for(i = 0; i < numberOfStudent; i++)
for(i = 0; i < numberOfStudent; i++)
for(i = 0; i < numberOfStudent; i++)
for(i = 0; i < numberOfStudent; i++)
- 토이/숫자뒤집기/김정현 . . . . 7 matches
String input= String.valueOf(num);
char[] numChars= String.valueOf(num).toCharArray();
char[] numChars= String.valueOf(num).toCharArray();
String intput= String.valueOf(num);
String number= String.valueOf(num);
char[] chars= String.valueOf(num).toCharArray();
String[] strings= String.valueOf(num).split("");
- 2002년도ACM문제샘플풀이/문제B . . . . 6 matches
[[TableOfContents]]
int numOfData;
index=pattern.find_first_of(c);
cin >> numOfData;
for(int i=0;i<numOfData;i++)
for(int i=0;i<numOfData;i++)
for(int i=0;i<numOfData;i++)
- 2002년도ACM문제샘플풀이/문제D . . . . 6 matches
[[TableOfContents]]
int numberOfData;
cin >> numberOfData;
for(int i = 0 ; i < numberOfData ; i++)
for(int i = 0 ; i < numberOfData ; i++)
for(int i = 0 ; i < numberOfData ; i++)
- 2002년도ACM문제샘플풀이/문제E . . . . 6 matches
[[TableOfContents]]
int numberOfData;
cin >> numberOfData;
for(int i=0;i<numberOfData;i++)
for(int i=0;i<numberOfData;i++)
for(int i=0;i<numberOfData;i++)
- AOI/2004 . . . . 6 matches
|| [SummationOfFourPrimes] || . || X || O || X || . || O ||
|| [HowManyZerosAndDigits] || . || O || X || . || . || . ||
|| [TugOfWar] || . || O || O || . || . || O || . || . ||
|| [HowManyFibs?] || . || . || X || . || . || . || . || . ||
- DesignPatternsAsAPathToConceptualIntegrity . . . . 6 matches
During our discussions about the organization of design patterns there was a comment about the difficulty of identifying the “generative nature” of design patterns. This may be a good property to identify, for if we understood how design patterns are used in the design process, then their organization may not be far behind. Alexander makes a point that the generative nature of design patterns is one of the key benefits. In practice, on the software side, the generative nature seems to have fallen away and the more common approach for using design patterns is characterized as “when faced with problem xyz…the solution is…” One might say in software a more opportunistic application of design patterns is prevalent over a generative use of design patterns.
The source of this difference may be the lack of focus on design patterns in the design process. In fact, we seldom see discussions of the design process associated with design patterns. It is as though design patterns are a tool that is used independent of the process. Let’s investigate this further:
· The existence of an architecture, on top of any object/class design
· The internal regularity (….or conceptual integrity) of the architectural design
This is what Brooks wrote 25 years ago. "… Conceptual integrity is the most important consideration in system design."[Brooks 86] He continues: “The dilemma is a cruel one. For efficiency and conceptual integrity, one prefers a few good minds doing design and construction. Yet for large systems one wants a way to bring considerable manpower to bear, so that the product can make a timely appearance. How can these two needs be reconciled?”
One approach would be to identify and elevate a single overriding quality (such as adaptability or isolation of change) and use that quality as a foundation for the design process. If this overriding quality were one of the goals or even a specific design criteria of the process then perhaps the “many” could produce a timely product with the same conceptual integrity as “a few good minds.” How can this be accomplished and the and at least parts of the “cruel dilemma” resolved?
하나의 어프로치는 정의, 가장 최우선의 중요한 특질을 상승시킨다. (어뎁터빌리티나 변화에 대한 분리) 그리고 이 퀄리티들들을 디자인 프로세스의 설립의 용도로 이용할 수 있다. 만일 이 최우선의 특징이 프로세스의 목적이나 구체적 디자인 분류의 하나라면 아마 'many'는 같은 개념적 완전성을 "약간의 좋은 감정"으로서 적시에 프로덕트를 ..
The following summary is from “Design Patterns as a Litmus Paper to Test the Strength of Object-Oriented Methods” and may provide some insight:
1. Some O-O design methodologies provide a systematic process in the form of axiomatic steps for developing architectures or micro-architectures that are optimality partitioned (modularized) according to a specific design criteria.
5. EDD and RDD will generate different design patterns that meet the primary modularization principle “encapsulate the part that changes.” in different ways when applied according to their axiomatic rules. For example RDD generates Mediator, Command, Template Method and Chain of responsibility (mostly behavior) where as EDD generates Observer, Composite, and Chain of responsibility (mostly structure).
EDO 와 RDD 는 이 1차 원리인 "변화하는 부분에 대해 캡슐화하라"와 그들의 명확한 룰들에 따라 적용될때 다른 방법들로 만나서, 다른 디자인 패턴들을 생성해 낼 것이다. 예를 들면, RDD는 Mediator, Command, TemplateMethod, ChainOfResponsibility (주로 behavior), EDD 는 Observer, Composite, ChainOfResposibility(주로 structure) 를 생성해낼것이다.
· Will strong O-O design methods produce results for the “many” with the same conceptual integrity as “a few good minds.”
설득력있는 O-O 디자인 메소드들이 "a few good minds" 처럼 같은 개념적 완전성을 가진 "many" 를 에 대한 결과물을 만들어낼 것인가?
· How does it meet this objective?
· Does this give insight into the organization of design patterns?
The dilemma is a cruel one. For efficiency and conceptual integrity, one prefers a few good minds doing design and construction. Yet for large systems one wants a way to bring considerable manpower to bear, so that the product can make a timely appearance. How can these two needs be reconciled?
- FromDuskTillDawn/조현태 . . . . 6 matches
int sizeOfTimeTable;
sscanf(readData, "%d", &sizeOfTimeTable);
for(register int i = 0; i < sizeOfTimeTable; ++i)
int numberOfTestCase = 0;
sscanf(readData, "%d", &numberOfTestCase);
for (register int i = 0; i < numberOfTestCase; ++i)
cout << "Vladimir needs " << g_minimumDelayTime / 24 << " litre(s) of blood. " << endl;
- HanoiProblem/임인택 . . . . 6 matches
public void solve(int numOfDiscs) {
for(int i=numOfDiscs; i>0; i--)
moveDiscs(numOfDiscs, 0);
public void moveDiscs(int numOfDiscs, int from) {
if( numOfDiscs > 3 ) {
moveDiscs(numOfDiscs-1, to);
towers[2].showDiscs();
public void showDiscs() {
- IpscLoadBalancing . . . . 6 matches
numOfElements=int(lexer.get_token())
for i in range(numOfElements):
numOfElements=lexer.get_token()
if numOfElements=='-':
numOfElements=int(numOfElements)
- MagicSquare/재동 . . . . 6 matches
if self.isOutOfUpAndRight():
elif self.isOutOfUp():
elif self.isOutOfRight():
def isOutOfUpAndRight(self):
def isOutOfUp(self):
def isOutOfRight(self):
- PowerOfCryptography . . . . 6 matches
=== About [PowerOfCryptography] ===
입력은 정수 쌍 n, p가 각각 한줄씩 입력됩니다. 여기서 n, p, k의 범위는 각각 1≤n≤200, [[HTML(1≤p≤10<sup>101</sup>)]],[[HTML(1≤k≤10<sup>9</sup>)]] 입니다. 입력의 끝 EOF입니다.
||[허아영] || C || 2시간 || [PowerOfCryptography/허아영] ||
||[문보창] || C++ || 3시간 || [PowerOfCryptography/문보창] ||
||[이영호] || C || 5분(코딩X:이론) + 13분(코딩) || [PowerOfCryptography/이영호] ||
||[조현태] || C/C++ || . || [PowerOfCryptography/조현태] ||
[PowerOfCryptography/Hint]
- RandomWalk2/재동 . . . . 6 matches
self.checkOutOfBoard()
def checkOutOfBoard(self):
self.checkOutOfbrd()
def checkOutOfbrd(self):
self.checkOutOfBoard()
def checkOutOfBoard(self):
- VonNeumannAirport/남상협 . . . . 6 matches
trafficOfCity = []
trafficOfCity.append(int(traffic))
self.trafficList.append(trafficOfCity)
configureOfCity = []
configureOfCity.append(eachConfigure)
self.configureList.append(configureOfCity)
- 데블스캠프2011 . . . . 6 matches
[[Tableofcontents]]
|| 5 || [변형진] || [:데블스캠프2011/첫째날/개발자는무엇으로사는가 개발자는 무엇으로 사는가] || [김동준] || [:데블스캠프2011/둘째날/Cracking Cracking - 창과 방패] || [김준석] || [:데블스캠프2011/셋째날/RUR-PLE RUR-PLE] || [이승한] || [:데블스캠프2011/넷째날/Git Git-분산 버전 관리 시스템] || [변형진] || [:데블스캠프2011/다섯째날/HowToWriteCodeWell How To Write Code Well] || 12 ||
|| 7 || [송지원] || [:데블스캠프2011/첫째날/Java Play with Java] || [:상협 남상협] || [:데블스캠프2011/둘째날/Machine-Learning Machine-Learning] || [윤종하], [황현] || [:데블스캠프2011/셋째날/Esolang 난해한 프로그래밍 언어] || [이승한] || [:데블스캠프2011/넷째날/Git Git-분산 버전 관리 시스템] || [변형진] || [:데블스캠프2011/다섯째날/HowToWriteCodeWell How To Write Code Well] || 2 ||
|| 8 || [송지원] || [:데블스캠프2011/첫째날/Java Play with Java] || [:상협 남상협] || [:데블스캠프2011/둘째날/Machine-Learning Machine-Learning] || [윤종하], [황현] || [:데블스캠프2011/셋째날/Esolang 난해한 프로그래밍 언어] || [서지혜] || [:데블스캠프2011/넷째날/루비 루비] || [변형진] || [:데블스캠프2011/다섯째날/HowToWriteCodeWell How To Write Code Well] || 3 ||
- 데블스캠프2011/셋째날/String만들기 . . . . 6 matches
|| indexOf || str2.indexOf("b") == 1 ||
|| lastIndexOf || str2.lastIndexOf("b") == 3 ||
|| valueOf || String::valueOf(3) == "3" ||
- 만년달력/영동 . . . . 6 matches
int[] daysOfMonth={31, 28, 31, 30, 31,30, 31, 31, 30, 31, 30, 31};//각 달의 날짜수
String[] nameOfday={"Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat"};//각 요일의 이름
int dYear=Integer.parseInt(JOptionPane.showInputDialog(null, "알고 싶은 연도 입력:", "만년달력", JOptionPane.QUESTION_MESSAGE));
int dMonth=Integer.parseInt(JOptionPane.showInputDialog(null, "알고 싶은 월 입력:", "만년달력", JOptionPane.QUESTION_MESSAGE));
daysOfMonth[1]=29;//입력받은 해의 2월에 윤달이 있는지 계산
totalDays+=daysOfMonth[i-1];
System.out.print(nameOfday[i]+"\t");
for(int i=1;i<daysOfMonth[dMonth-1]+1;i++)
- 서지혜 . . . . 6 matches
[[TableOfContents]]
= PROFILE =
* 엔포지 : [http://nforge.zeropage.org/projects/bigtablet/wiki/FrontPage?action=show 빅테이블 분석및설계]
* [http://nforge.zeropage.org/projects/deletewastes/wiki/FrontPage?action=show 엔포지 링크]
* 디버거를 사용할 수 없는 환경을 난생 처음 만남. print문과 로그만으로 디버깅을 할 수 있다는 것을 깨달았다. 정보 로그, 에러 로그를 분리해서 에러로그만 보면 편하다. 버그가 의심되는 부분에 printf문을 삽입해서 값의 변화를 추적하는 것도 효과적이다(달리 할수 있는 방법이 없다..). 오늘 보게된 [http://wiki.kldp.org/wiki.php/HowToBeAProgrammer#s-3.1.1 HowToBeAProgrammer]에 이 내용이 올라와있다!! 이럴수가 난 삽질쟁이가 아니었음. 기쁘다.
* [http://cacm.acm.org/magazines/2010/1/55760-what-should-we-teach-new-software-developers-why/fulltext 어느 교수님의 고민] - 우리는 무엇을 가르치고, 무엇을 배워야 하는가?
* [HowToStudyDesignPatterns]
* [HowToStudyRefactoring]
* [HowToStudyRefactoring]
- 서지혜/Calendar . . . . 6 matches
[[TableOfContents]]
months.add(new Month(i, getDaysOfMonth(year, i), getStartDate(year, i)));
public static int getDaysOfYear(int year) {
public static int getDaysOfMonth(int year, int month) {
for (int i = 1; i < year; i++) { // add days of years
totalDays += getDaysOfYear(i);
for (int i = 1; i < month; i++) { // add days of months
totalDays += getDaysOfMonth(year, i);
Year.new(year, months_of_year(year), is_leap(year))
def months_of_year(year)
months << Month.new(month, length_of_month(year, month), start_date(year, month))
def length_of_month(year, month)
total += length_of_month(year, x)
- 지금그때/OpeningQuestion . . . . 6 matches
[[TableOfContents]]
* off-Line 지향
* on-Line 연장 -> off-Line -> 만나면서 자유롭게 대한다.
Pragmatic Programmers의 [http://www.pragmaticprogrammer.com/talks/HowToKeepYourJob/HowToKeepYourJob.htm How To Keep Your Job]을 강력 추천합니다. --JuNe
같은 주제 읽기(see HowToReadIt)를 하기에 도서관만한 곳이 없습니다. 그 경이적인 체험을 꼭 해보길 바랍니다. 그리고 도서신청제도를 적극적으로 활용하세요. 학생 때는 돈이 부족해서 책을 보지 못하는 경우도 있는데, 그럴 때에 사용하라고 도서신청제도가 있는 것입니다. --JuNe
잡지 경우, ItMagazine에 소개된 잡지들 중 특히 CommunicationsOfAcm, SoftwareDevelopmentMagazine, IeeeSoftware. 국내 잡지는 그다지 추천하지 않음. 대신 어떤 기사들이 실리는지는 항상 눈여겨 볼 것. --JuNe
- 컴퓨터공부지도 . . . . 6 matches
'What' 의 영역과 & 'How' 의 영역.
Windows 에서 GUI Programming 을 하는 방법은 여러가지이다. 언어별로는 Python 의 Tkinter, wxPython 이 있고, Java 로는 Swing 이 있다. C++ 로는 MFC Framework 를 이용하거나 Windows API, wxWindows 를 이용할 수 있으며, MFC 의 경우 Visual Studio 와 연동이 잘 되어서 프로그래밍 하기 편하다. C++ 의 다른 GUI Programming 을 하기위한 툴로서는 Borland C++ Builder 가 있다. (C++ 중급 이상 프로그래머들에게서 오히려 더 선호되는 툴)
See Also HowToStudyXp, HowToReadIt, HowToStudyDataStructureAndAlgorithms, HowToStudyDesignPatterns, HowToStudyRefactoring
- 1thPCinCAUCSE/ExtremePair전략 . . . . 5 matches
int numOfData;
cin >> numOfData;
for(int i=0;i<numOfData;i++)
for(int i=0;i<numOfData;i++)
for(int i=0;i<numOfData;i++)
- CppStudy_2002_1 . . . . 5 matches
[[TableOfContents]]
|| 8.1 ||10.클래스를 사용하자(64page)||["StringOfCPlusPlus"] ||
|| 세번째 주 || ["StringOfCPlusPlus/영동"] ["StringOfCPlusPlus"] || 영동 ||
* ["StringOfCPlusPlus"]가 참 유익했던 거 같습니다. 제가 이걸 하기 전엔 문자열을 다루는데 어려움이 많았는데 이걸 하고 나니까 좀 쉬워진 듯한 느낌이네요. -[영동]
- DirectDraw . . . . 5 matches
[[TableOfContents]]
DirectDraw객체의 생성 -> 표면의 생성(Front, Back, OffScreen) -> 그리고.. 표면 뒤집기..
ZeroMemory(&ddsd, sizeof(ddsd));
ddsd.dwSize = sizeof(ddsd); // 크기를 저장
ZeroMemory(&ddscaps, sizeof(ddscaps)); // 메모리 초가화
=== DirectDraw OffScreen의 생성 ===
LPDIRECTDRAWSURFACE7 lpDDSOff;
ZeroMemory(&ddsd, sizeof(ddsd));
ddsd.dwSize = sizeof(ddsd);
ddsd.ddsCaps.dwCaps = DDSCAPS_OFFSCREENPLAIN; // 오프스크린임을 표시
hr = lpDD->CreateSurface(&ddsd, &lpDDSOff, NULL); // 표면 생성!
GetObject(hb, sizeof(bmp), &bmp);
ddsd.dwSize = sizeof(ddsd);
- EightQueenProblem/kulguy . . . . 5 matches
System.out.println("소요시간(ms) = " + String.valueOf(System.currentTimeMillis() - start));
System.out.println("가능한 해답 = " + String.valueOf(problem.getSuccessNum()));
// System.out.println("성공 " + String.valueOf(++successNum));
return "(" + String.valueOf(x) + ", " + String.valueOf(y) + ")";
- FortuneCookies . . . . 5 matches
* He who spends a storm beneath a tree, takes life with a grain of TNT.
* You attempt things that you do not even plan because of your extreme stupidity.
* Take care of the luxuries and the necessities will take care of themselves.
* Words are the voice of the heart.
* The best prophet of the future is the past.
* Might as well be frank, monsieur. It would take a miracle to get you out of Casablanca.
* Expect a letter from a friend who will ask a favor of you.
* You will overcome the attacks of jealous associates.
* Many pages make a thick book.
* Alimony and bribes will engage a large share of your wealth.
* You will step on the soil of many countries.
* Mind your own business, Spock. I'm sick of your halfbreed interference.
* You are secretive in your dealings but never to the extent of trickery.
* You are tricky, but never to the point of dishonesty.
* Of all forms of caution, caution in love is the most fatal.
* Show your affection, which will probably meet with pleasant response.
* You are dishonest, but never to the point of hurting a friend.
* The Tree of Learning bears the noblest fruit, but noble fruit tastes bad.
* How sharper than a hound's tooth it is to have a thankless serpent.
* Mistakes are oft the stepping stones to failure.
- HowManyPiecesOfLand?/문보창 . . . . 5 matches
[HowManyPiecesOfLand?]
- HowToStudyDesignPatterns . . . . 5 matches
DP의 저자(GoF) 중 한 명인 랄프 존슨은 다음과 같이 말합니다:
''We were not bold enough to say in print that you should avoid putting in patterns until you had enough experience to know you needed them, but we all believed that. I have always thought that patterns should appear later in the life of a program, not in your early versions.''
역시 GoF의 한명인 존 블리스사이즈는 다음과 같이 말합니다:
''The other thing I want to underscore here is how to go about reading Design Patterns, a.k.a. the "GoF" book. Many people feel that to fully grasp its content, they need to read it sequentially. But GoF is really a reference book, not a novel. Imagine trying to learn German by reading a Deutsch-English dictionary cover-to-cover;it just won't work! If you want to master German, you have to immerse yourself in German culture. You have to live German. The same is true of design patterns: you must immerse yourself in software development before you can master them. You have to live the patterns.
Read Design Patterns like a novel if you must, but few people will become fluent that way. Put the patterns to work in the heat of a software development project. Draw on their insights as you encounter real design problems. That’s the most efficient way to make the GoF patterns your own.''
주변에서 특정 패턴이 구현된 코드를 구하기가 힘들다면 이 패턴을 자신이 만지고 있는 코드에 적용해 보려고 노력해 볼 수 있습니다. 이렇게 해보고 저렇게도 해보고, 그러다가 오히려 복잡도만 증가하면 "아 이 경우에는 이 패턴을 쓰면 안되겠구나"하는 걸 학습할 수도 있죠. GoF는 한결 같이 패턴을 배울 때에는 "이 패턴이 적합한 상황과 동시에 이 패턴이 악용/오용될 수 있는 상황"을 함께 공부하라고 합니다.
그런데 사실 GoF의 DP에 나온 패턴들보다 더 핵심적인 어휘군이 있습니다. 마이크로패턴이라고도 불리는 것들인데, delegation, double dispatch 같은 것들을 말합니다. DP에도 조금 언급되어 있긴 합니다. 이런 마이크로패턴은 우리가 알게 모르게 매일 사용하는 것들이고 그 활용도가 아주 높습니다. 실제로 써보면 알겠지만, DP의 패턴 하나 쓰는 일이 그리 흔한 게 아닙니다. 마이크로패턴은 켄트벡의 SBPP에 잘 나와있습니다. 영어로 치자면 관사나 조동사 같은 것들입니다.
1. ["DesignPatterns"] : Gang Of four가 저술한 디자인패턴의 바이블
1. ["DesignPatternSmalltalkCompanion"] : GoF가 오른쪽 날개라면 DPSC는 왼쪽 날개
1. Pattern Languages of Program Design 1,2,3,4 : 패턴 컨퍼런스 논문 모음집으로 대부분은 인터넷에서 구할 수 있음
1. ["PatternOrientedSoftwareArchitecture"] 1,2 : 아키텍춰 패턴 모음
1. Patterns of Software by Richard Gabriel : 패턴에 관한 중요한 에세이 모음.
1. A Timeless Way of Building by Christopher Alexander : 프로그래머들이 가장 많이 본 건축서적. 패턴의 아버지
DP를 처음 공부한다면, DPE와 DPJW를 RF와 함께 보면서 앞서의 두권을 RF적으로 독해해 나가기를 권합니다. 이게 된 후에는 {{{~cpp GoF}}}와 DPSC를 함께 볼 수 있겠습니다. 양자는 상호보완적인 면이 강합니다. 이 쯤 되어서 SBPP를 보면 상당히 충격을 받을 수 있습니다. 스스로가 생각하기에 코딩 경험이 많다면 다른 DP책 이전에 SBPP를 먼저 봐도 좋습니다.
* GofStructureDiagramConsideredHarmful - 관련 Article.
* 패턴이 어떻게 생성되었는지 그 과정을 보여주지 못한다. 즉, 스스로 패턴을 만들어내는 데에 전혀 도움이 안된다. (NoSmok:LearnHowTheyBecameMasters)
알렉산더가 The Timeless Way of Building의 마지막에서 무슨 말을 하는가요?
see also HowToStudyRefactoring, HowToStudyXp
- JollyJumpers/Leonardong . . . . 5 matches
if self.checkJolly( aSet = self.getSetOfDiffence( aSeries[1:] ),
def getSetOfDiffence( self, aSeries ):
def testGetSetOfDiffernce(self):
self.assertEquals( str(self.jj.getSetOfDiffence( aSeries = [5,6,8] )),
self.assertEquals( str(self.jj.getSetOfDiffence( aSeries = [7,6,4] )),
- LIB_2 . . . . 5 matches
MOV S_OFF,SP
High_Task->StackOff = S_OFF;
S_OFF = High_Task->StackOff;
MOV SP,S_OFF
START_TCB.StackOff = 0;
MOV DI,offset oldtimer
MOV AX,offset LIB_ISR
MOV S_OFF,SP
High_Task->StackOff = S_OFF;
S_OFF = High_Task->StackOff;
MOV SP,S_OFF
- OOP/2012년스터디 . . . . 5 matches
[[TableOfContents]]
puts("2. Print Calander");
int numberOfDays(int year, int month);
for(int i = 1; i <= numberOfDays(year, month); i++){
sum += numberOfDays(year, i);
int numberOfDays(int year, int month){
- OpenGL스터디_실습 코드 . . . . 5 matches
[[TableOfContents]]
* How to use :
* 1. use up, down, left, right key in your key board. then its direction of viewpoint will be changed.
//angle change in case of finding key event command.
* How to use :
//setup kind of line which is outter line or not.
glutAddMenuEntry("Off", 5);
* How to use :
//exectly half of width and height
//if rectangle coordinate is out of window, then reverse it's movement.
//register GLUT_STENCIL(because of stencil buffer), if you want to use stensil function.
- SeminarHowToProgramIt . . . . 5 matches
애들러의 How to Read a Book과 폴리야의 How to Solve it의 전통을 컴퓨터 프로그래밍 쪽에서 잇는 세미나가 2002년 4월 11일 중앙대학교에서 있었다.
see also SeminarHowToProgramItAfterwords
* ["CrcCard"] (Index Card -- The finalist of Jolt Award for "design tools" along with Rational Rose Enterprise Edition)
* Coding Style -- esp. How to Name it (프로그래머를 위한 정명학. "子曰 必也正名乎...名不正則言不順 言不順則事不成" <논어> 자로편)
* Managing To Do List -- How to Become More Productive Only With a To-do List While Programming
이 때, OOP가 가능한 언어를 추천하고, 해당 언어의 xUnit 사용법을 미리 익혀오기 바랍니다. (반나절 정도가 필요할 겁니다) http://www.xprogramming.com/software.htm 에서 다운 받을 수 있습니다.
- SummationOfFourPrimes . . . . 5 matches
== About[SummationOfFourPrimes] ==
|| [문보창] || C++ || . || [SummationOfFourPrimes/문보창] || O ||
|| [김회영] || C++ || ? || [SummationOfFourPrimes/김회영] || . ||
|| [곽세환] || C++ || ? || [SummationOfFourPrimes/곽세환] || O ||
|| [1002] || Python || 50분(이후 튜닝 진행. 총 2시간 46분 23초) || [SummationOfFourPrimes/1002] || X (5.7s) ||
- TFP예제/WikiPageGather . . . . 5 matches
[[TableOfContents]]
self.assertEquals (self.pageGather.GetPageNamesFromPage (), ["LearningHowToLearn", "ActiveX", "Python", "XPInstalled", "TestFirstProgramming", "한글테스트", "PrevFrontPage"])
'["LearningHowToLearn"]\n\n\n=== C++ ===\n["ActiveX"]\n\n' +
pagename : LearningHowToLearn
filename : LearningHowToLearn
- TheJavaMan/지뢰찾기 . . . . 5 matches
numLeftMines.setText(String.valueOf(numMines));
numLeftMines.setText(String.valueOf(numMines));
numLeftMines.setText(String.valueOf(numMines - numFlags));
numLeftMines.setText(String.valueOf(numMines - numFlags));
setText(String.valueOf(numAroundMines));
- TheKnightsOfTheRoundTable . . . . 5 matches
=== TheKnightsOfTheRoundTable ===
{{| The radius of the round table is: r |}}
{{| The radius of the round table is: 2.828 |}}
|| 하기웅 || C++ || 1시간 || [TheKnightsOfTheRoundTable/하기웅] ||
|| 김상섭 || C++ || 엄청 || [TheKnightsOfTheRoundTable/김상섭] ||
|| 문보창 || C++ || 10분 || [TheKnightsOfTheRoundTable/문보창] ||
|| 허준수 || C++|| ? || [TheKnightsOfTheRoundTable/허준수] ||
- ToyProblems . . . . 5 matches
ToyProblems를 풀게 하되 다음 방법을 이용한다. Seminar:TheParadigmsOfProgramming [http://www.jdl.ac.cn/turing/pdf/p455-floyd.pdf (pdf)]을 학습하게 하는 것이다.
ToyProblems를 풀면서 접하게 될 패러다임들(아마도): CSP, Generators, Coroutines, Various Forms of Recursion, Functional Programming, OOP, Constraint Programming, State Machine, Event Driven Programming, Metaclass Programming, Code Generation, Data Driven Programming, AOP, Generic Programming, Higher Order Programming, Lazy Evaluation, Declarative Programming, ...
* HTDP (How To Design Programs) http://www.htdp.org/
* HowToSolveIt
* How to Prove it
* How to Read and Do Proofs
* Proofs and Refutations (번역판 있음)
* The Art and Craft of Problem Solving
- WOWAddOn/2011년프로젝트/초성퀴즈 . . . . 5 matches
[[TableOfContents]]
Eclipse에서 Java외의 다른것을 돌리려면 당연 인터프리터나 컴파일러를 설치해주어야 한다. 그래서 Lua를 설치하려했다. LuaProfiler나 LuaInterpreter를 설치해야한다는데 도통 영어를 못읽겠다 나의 무식함이 들어났다.
설치된경로를 따라 Eclipse의 Profiler말고 Interpreter로 lua.exe로 path를 설정해주면 Eclipse에서 Project를 만든뒤 출력되는 Lua파일을 볼수 있다.
기본적으로 "/World of Warcraft/interface/addons/애드온명" 으로 폴더가 만들어져있어야한다.
HelloWoW_ShowMessage();
function HelloWoW_ShowMessage()
http://www.wowwiki.com/World_of_Warcraft_API
function HelloWoW_ShowMessage()
function HelloWoW_ShowMessage()
function HelloWoW_ShowMessage()
http://www.castaglia.org/proftpd/doc/contrib/regexp.html
function HelloWoW_ShowMessage()
HelloWoW_ShowMessage(self)
function HelloWoW_ShowMessage(self)
How Often Is It Called
OnUpdate is not called on any hidden frames, only while they are shown on-screen. OnUpdate will also never be called on a virtual frame, but will be called on any frames that inherit from one.
<Offset>
</Offset>
- django/Model . . . . 5 matches
#id = models.AutoField()
employees= models.ManyToManyField(Employee)
Upload:Screenshot-ManyToOne.png
Upload:Screenshot-ManyToMany.png
- 만년달력/인수 . . . . 5 matches
protected int getNumOfDays() {
for(int i = start ; i < getNumOfDays() + start ; ++i)
protected int getNumOfLeapYears() {
int ret = year + getNumOfLeapYears();
for(int i = start ; i < calendar.getNumOfDays() + start ; ++i)
- 바퀴벌레에게생명을 . . . . 5 matches
[[TableOfContents]]
스페이스바를 누르면 tile배열의 모든 frequency가 0이되고 처음 밟은 타일의 갯수(numberOfVirginTile)가 총 타일의 숫자와 같아진다. 바퀴벌레가 타일을 밟을 때마다 그 타일의 frequency는 늘어나고, frequency가 0인 타일을 밟았을 경우 numberOfVirginTile은 줄어든다.
타이머의 주기마다 바퀴벌레는 움직이고 그 움직임과 각 타일의 빈도수를 뷰에 그려준다. 종료조건은 스페이스바의 키이벤트와 모든 타일을 적어도 한번씩 밟았을 경우(numberOfVirginTile == 0)이다.
다큐에 TotalNumberOfMovement변수를 생성하여 바퀴벌레가 움직일 때마다 늘려준다. 그리고 프로그램이 정상종료 되었을 때(스페이스바에 의한 종료는 정상종료가 아니다.) 메세지 박스로 그 값을 출력한다.
- 영호의바이러스공부페이지 . . . . 5 matches
002...........................How to modify viruses to avoid SCAN
what our good friend Patti Hoffman (bitch) has written about it.
of Iceland in June 1990. This virus is a non-resident generic
smallest MS-DOS virus known as of its isolation date.
Here is a dissasembly of the virus, It can be assembled under Turbo Assembler
data_2e equ 1ABh ;start of virus
org 100h ;orgin of all COM files
sub si,10Bh ;si, cause all offsets will
lea dx,[si+1A2h] ;offset of '*.COM',0 - via SI
mov dx,9Eh ;offset of filename found
lea dx,[si+1A8h] ;offset of save buffer
mov dx,[di+1] ;lsh of offset
xor cx,cx ;msh of offset
lea dx,[si+105h] ;segment:offset of write buffer
xor cx,cx ;to the top of the file
lea dx,[si+1ABh] ;offset of jump to virus code
Its good to start off with a simple example like this. As you can see
first two bytes of the COM file. If they match the program terminates.
CX = most significant half to offset
DX = most significant half of file pointer
- 위키로프로젝트하기 . . . . 5 matches
[[TableOfContents]]
* How - 목표를 위한 방법과 일정의 기록이다. Offline 또는 Online 상에서 한 일에 대한 ["ThreeFs"] 를 남겨라.
* 공동 번역 - 영어 원문을 링크를 걸거나 전문을 실은뒤 같이 번역을 해 나가는 방법이다. Offline 으로만으로도 가능한 방법이지만 효율적인 방법으로 다른 방법들을 곁들일 수 있겠다.
* 온라인이라는 잇점이 있다. 시간과 공간의 제약을 덜 받는다. 하지만, 오프라인을 배제해서는 안된다. 각각의 대화수단들은 장단점들이 존재한다. 위키의 프로젝트는 가급적 Offline에서의 프로젝트, 스터디와 이어져야 그 효과가 클 것이다. ZeroPage 의 ["정모"] 때 자신이 하고 있는 일에 대한 상황을 발표하고, 서로 의사소통을 할 수 있겠다.
- Android/WallpaperChanger . . . . 4 matches
[[TableOfContents]]
cursor.moveToFirst();
Toast.makeText(getApplicationContext(), "배경화면 지정 성공", 1).show();
Toast.makeText(getApplicationContext(), "배경화면 지정 실패", 1).show();
문자열을 처리할 때, String.indexOf(), String.lastIndexOf() 와 그 밖의 특별한 메소드를 사용하는 것을 주저하지 마십시오. 이 메소드들은 대체적으로, 자바 루프로 된 것 보다 대략 10-100배 빠른 C/C++ 코드로 구현이 되어있습니다.
computeHorizontalScrollOffset(),
물론, 반대적 측면에서 열거형으로 더 좋은 API를 만들 수 있고 어떤 경우엔 컴파일-타임 값 검사를 할 수 있습니다. 그래서 통상의 교환조건(trade-off)이 적용됩니다: 반드시 공용 API에만 열거형을 사용하고, 성능문제가 중요할 때에는 사용을 피하십시오.
- AseParserByJhs . . . . 4 matches
#define UOFFSET "*UVW_U_OFFSET"
#define VOFFSET "*UVW_V_OFFSET"
vec_t uTile; // u tiling of texture
vec_t vTile; // v tiling of "
vec_t uOffset; // u offset of "
vec_t vOffset; // v offset of "
memcpy (pDest, pChildTmp, sizeof (CHS_Model*) * (pNodeList [i2]->GetChildNum ()-1)); // 복사
while (!feof (s)) //파일 스트림이 끝났는지 check!
fgets (data, sizeof (data), s);
while (!feof (s)) //파일 스트림이 끝났는지 check!
fgets (data, sizeof (data), s);
while (!feof (s))
// in 3dsm negative z goes out of the screen, we want it to go in
memcpy (&pM->pPosKey[nTmpCount2].p, p, sizeof (vec3_t));
else if (strcmp (data, UOFFSET) == 0)
pM->texture.uOffset = GetFloatVal (s);
else if (strcmp (data, VOFFSET) == 0)
pM->texture.vOffset = GetFloatVal (s);
fgets (data, sizeof (data), s);
- AustralianVoting/Leonardong . . . . 4 matches
// cin >> numOfCase;
int numOfCandidators;
cin >> numOfCandidators;
int n = numOfCandidators;
- ClassifyByAnagram/sun . . . . 4 matches
[[TableOfContents]]
* Profiling
g.drawString( "Estimated power: " + String.valueOf(elapsed), 10, 90 );
ch = String.valueOf( str.charAt( i ));
table.put( ch, String.valueOf(Integer.parseInt((String)value)+1));
- Counting/황재선 . . . . 4 matches
BigInteger numOfEachCounting = zero;
numOfEachCounting = numOfEachCounting.add(first.add(second));
sum[input] = numOfEachCounting;
- CubicSpline/1002/test_NaCurves.py . . . . 4 matches
def testMany(self):
def testSubBasedFunctionMany(self):
def testCountPieces(self):
self.assertEquals (pl.getCountPieces(), 4)
- HardcoreCppStudy/두번째숙제 . . . . 4 matches
||[HardcoreCppStudy/두번째숙제/CharacteristicOfOOP/변준원] ||
||[HardcoreCppStudy/두번째숙제/CharacteristicOfOOP/장창재] ||
||[HardcoreCppStudy/두번째숙제/CharacteristicOfOOP/임민수] ||
||[HardcoreCppStudy/두번째숙제/CharacteristicOfOOP/김아영] ||
- Hartals/상협재동 . . . . 4 matches
int numberOfHartal;
cin >> numberOfHartal;
for(int i = 0; i < numberOfHartal; i++)
for(int i = 0; i < numberOfHartal; i++)
- InvestMulti - 09.22 . . . . 4 matches
quantity = input('How Many do want to buy this item ? ')
quantity = input('How Many do want to buy this item ? ')
- SelfDelegation . . . . 4 matches
hash = collection->hashOf(keyObject);
이제 hashOf를 폴리모피즘으로 구현할 수 있다.
HashTable& Dictionary::hashOf(const T& object) {
HashTable& IdentityDictionary::hashOf(const T& object) {
- StacksOfFlapjacks . . . . 4 matches
=== About [StacksOfFlapjacks] ===
|| [이동현] || C++ || 2시간 || [StacksOfFlapjacks/이동현] ||
|| [문보창] || C++ || 30분 || [StacksOfFlapjacks/문보창] ||
|| [조현태] || C || . || [StacksOfFlapjacks/조현태] ||
- StacksOfFlapjacks/이동현 . . . . 4 matches
[StacksOfFlapjacks]
//Stacks Of Flapjacks:2005.04.15 이동현
class StacksOfFlapjacks{
StacksOfFlapjacks sof;
while(cin >> arr[j]){ //입력의 끝은 ^Z(EOF)를 흉내내서 종료.
sof.run(arr,j);
- SummationOfFourPrimes/곽세환 . . . . 4 matches
int sumOfThreePrimes;
sumOfThreePrimes = input - i;
if (sumOfThreePrimes == primeTable[i] + primeTable[j] + primeTable[k])
[SummationOfFourPrimes]
- TheWarOfGenesis2R . . . . 4 matches
|| [[TableOfContents]] ||
[TheWarOfGenesis2R/일지]
[TheWarOfGenesis2R/ToDo]
|| ["TheWarOfGenesis2R/Temp"] ||
- TwistingTheTriad . . . . 4 matches
One example of this deficiency surfaced in SmalltalkWorkspace widget. This was originally designed as a multiline text-editing component with additional logic to handle user interface commands such as Do-it, Show-it, Inspect-it etc. The view itself was a standard Windows text control and we just attached code to it to handle the workspace functionality. However, we soon discovered that we also wanted to have a rich text workspace widget too. Typically the implementation of this would have required the duplication of the workspace logic from the SmalltalkWorkspace component or, at least, an unwarranted refactoring session. It seemed to us that the widget framework could well do with some refactoring itself!
In MVC, most of the application functionality must be built into a model class known as an Application Model. It is the reponsibility of the application model to be the mediator between the true domain objects and the views and their controllers. The views are responsible for displaying the domain data while the controller handle the raw usr gestures that will eventually perform action on this data. So the application model typically has method to perform menu command actions, push buttons actions and general validation on the data that it manages. Nearly all of the application logic will reside in the application model classes. However, because the application model's role is that of a go-between, it is at times necessary for it to gain access to the user interface directly but, because of the Observer relationship betweeen it and the view/controller, this sort of access is discouraged.
For example, let's say one wants to explicitly change the colour of one or more views dependent on some conditions in the application model. The correct way to do this in MVC would be to trigger some sort of event, passing the colour along with it. Behaviour would then have to be coded in the view to "hang off" this event and to apply the colour change whenever the event was triggered. This is a rather circuitous route to achieving this simple functionality and typically it would be avoided by taking a shoutcut and using #componentAt : to look up a particular named view from the application model and to apply the colour change to the view directly. However, any direct access of a view like this breaks the MVC dictum that the model should know nothing about the views to which it is connected. If nothing else, this sort of activity surely breaks the possibility of allowing multiple views onto a model, which must be the reason behind using the Observer pattern in MVC in the first place.
This is the data upon which the user interface will operate. It is typically a domain object and the intention is that such objects should have no knowledge of the user interface. Here the M in MVP differs from the M in MVC. As mentioned above, the latter is actually an Application Model, which holds onto aspects of the domain data but also implements the user interface to manupulate it. In MVP, the model is purely a domain object and there is no expectation of (or link to) the user interface at all.
The behaviour of a view in MVP is much the same as in MVC. It is the view's responsibility to display the contents of a model. The model is expected to trigger appropriate change notification whenever its data is modified and these allow the view to "hang off" the model following the standard Observer pattern. In the same way as MVC does, this allows multiple vies to be connected to a single model.
One significant difference in MVP is the removal of the controller. Instead, the view is expected to handle the raw user interface events generated by the operating system (in Windows these come in as WM_xxxx messages) and this way of working fits more naturally into the style of most modern operating systems. In some cases, as a TextView, the user input is handled directly by the view and used to make changes to the model data. However, in most cases the user input events are actually routed via the presenter and it is this which becomes responsible for how the model gets changed.
While it is the view's responsibility to display model data it is the presenter that governs how the model can be manipulated and changed by the user interface. This is where the heart of an application's behaviour resides. In many ways, a MVP presenter is equivalent to the application model in MVC; most of the code dealing with how a user interface works is built into a presenter class. The main difference is that a presenter is ''directly'' linked to its associated view so that the two can closely collaborate in their roles of supplying the user interface for a particular model.
=== Benefits of MVP ===
Compared with our orignnal widget framework, MVP offers a much greater separation between the visual presentation of an interface and the code required to implement the interface functionality. The latter resides in one or more presenter classes that are coded as normal using a standard class browser.
- UML . . . . 4 matches
In software engineering, Unified Modeling Language (UML) is a non-proprietary, third generation modeling and specification language. However, the use of UML is not restricted to model software. It can be used for modeling hardware (engineering systems) and is commonly used for business process modeling, organizational structure, and systems engineering modeling. The UML is an open method used to specify, visualize, construct, and document the artifacts of an object-oriented software-intensive system under development. The UML represents a compilation of best engineering practices which have proven to be successful in modeling large, complex systems, especially at the architectural level.
This diagram describes the functionality of the (simple) Restaurant System. The Food Critic actor can Eat Food, Pay for Food, or Drink Wine. Only the Chef Actor can Cook Food. Use Cases are represented by ovals and the Actors are represented by stick figures. The box defines the boundaries of the Restaurant System, i.e., the use cases shown are part of the system being modelled, the actors are not.
The OMG defines a graphical notation for [[use case]]s, but it refrains from defining any written format for describing use cases in detail. Many people thus suffer under the misapprehension that a use case is its graphical notation; when in fact, the true value of a use case is the written description of scenarios regarding a business task.
This diagram describes the structure of a simple Restaurant System. UML shows [[Inheritance_(computer_science)|Inheritance]] relationships with a [[triangle]]; and containers with [[rhombus|diamond shape]]. Additionally, the role of the relationship may be specified as well as the cardinality. The Restaurant System has any number of Food dishes(*), with one Kitchen(1), a Dining Area(contains), and any number of staff(*). All of these objects are associated to one Restaurant.
This diagram describes the sequences of messages of the (simple) Restaurant System. This diagram represents a Patron ordering food and wine; drinking wine then eating the food; finally paying for the food. The dotted lines extending downwards indicate the timeline. The arrows represent messages (stimuli) from an actor or object to other objects. For example, the Patron sends message 'pay' to the Cashier. Half arrows indicate asynchronous method calls.
Above is the collaboration diagram of the (simple) Restaurant System. Notice how you can follow the process from object to object, according to the outline below:
A Collaboration diagram models the interactions between objects in terms of sequenced messages. Collaboration diagrams represent a combination of information taken from [[#UML_Class Diagram|Class]], [[#UML_Sequence_Diagram|Sequence]], and [[#UML_Use_Case_Diagram|Use Case Diagrams]] describing both the static structure and dynamic behavior of a system.
However, collaboration diagrams use the free-form arrangement of objects and links as used in Object diagrams. In order to maintain the ordering of messages in such a free-form diagram, messages are labeled with a chronological number and placed near the link the message is sent over. Reading a Collaboration diagram involves starting at message 1.0, and following the messages from object to object.
Activity diagrams represent the business and operational workflows of a system. An Activity diagram is a variation of the state diagram where the "states" represent operations, and the transitions represent the activities that happen when the operation is complete.
This activity diagram shows the actions that take place when completing a (web) form.
The user starts by filling out the form, then it is checked; the result of the check determines if the form has to be filled out again or if the activity is completed.
Deployment diagrams serve to model the hardware used in system implementations and the associations between those components. The elements used in deployment diagrams are nodes (shown as a cube), components (shown as a rectangular box, with two rectangles protruding from the left side) and associations.
This deployment diagram shows the hardware used in a small office network. The application server (node) is connected to the database server (node) and the database client (component) is installed on the application server. The workstation is connected (association) to the application server and to a printer.
== Criticisms of UML ==
Although UML is a widely recognized and used standard, it is criticized for having imprecise semantics, which causes its interpretation to be subjective and therefore difficult for the formal test phase. This means that when using UML, users should provide some form of explanation of their models.
Another problem is that UML doesn't apply well to distributed systems. In such systems, factors such as serialization, message passing and persistence are of great importance. UML lacks the ability to specify such things. For example, it is not possible to specify using UML that an object "lives" in a [[server]] process and that it is shared among various instances of a running [[process]].
At the same time, UML is often considered to have become too bloated, and fine-grained in many aspects. Details which are best captured in source code are attempted to be captured using UML notation. The [[80-20 rule]] can be safely applied to UML: a small part of UML is adequate for most of the modeling needs, while many aspects of UML cater to some specialized or esoteric usages.
(However, the comprehensive scope of UML 2.0 is appropriate for [[model-driven architecture]].)
A third problem which leads to criticism and dissatisfaction is the large-scale adoption of UML by people without the required skills, often when management forces UML upon them.
- 강희경/도서관 . . . . 4 matches
[[TableOfContents]]
* Pleasure Of Finding Things Out (리처드 파인만)
|| 4 || NoSmoke:TheArtOfComputerProgramming || 카누스 || [강희경] || [TAOCP] ||
|| 1 || NoSmoke:TheArtOfComputerProgramming || 카누스 || [강희경] || [TAOCP] ||
- 김희성/MTFREADER . . . . 4 matches
#define OUT_OF_MEMORY_ERROR 2
long ReadAttribute(FILE* fp, unsigned char* offset, long flag);
ReadFile(hVolume, &boot_block, sizeof(boot_block), &cnt, 0);
unsigned __int64 offset;
ErrorCode=OUT_OF_MEMORY_ERROR;
point=*((unsigned short*)((unsigned char*)$MFT+20));//Offset으로 포인터 이동
ErrorCode=OUT_OF_MEMORY_ERROR;
ULARGE_INTEGER offset;
offset.QuadPart = sector * boot_block.BytesPerSector;
overlap.Offset = offset.LowPart;
overlap.OffsetHigh = offset.HighPart;
unsigned char* offset=0;
offset=(new U8[*((unsigned __int64*)((unsigned char*)point+40))]);
offset=0;
if(offset)
ReadCluster(point+(*(short*)((unsigned char*)point+32)),offset);
offset=point+24+*((unsigned char*)point+9);
if(!offset)
FileTimeToSystemTime((FILETIME*)offset,&time);
FileTimeToSystemTime((FILETIME*)(offset+8),&time);
- 만년달력/재니 . . . . 4 matches
int numOfMonth[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
numOfMonth[1] = 29;
theFirstDay = ( theFirstDay + numOfMonth[i - 1] ) % 7;
for (i = 0 ; i < numOfMonth[month - 1] ; i++){
- 오목/인수 . . . . 4 matches
int numOfStone = 1;
++numOfStone;
++numOfStone;
return numOfStone;
JOptionPane.showMessageDialog(parent, message);
JOptionPane.showMessageDialog(parent, message);
JOptionPane.showMessageDialog(parent, message);
OmokFrame of;
of = new OmokFrame("오목");
assertEquals( 50, of.getValidLocation(50) );
assertEquals( 100, of.getValidLocation(80) );
assertEquals( 100, of.getValidLocation(120) );
assertEquals( 50, of.getValidLocation(15) );
assertEquals( 550, of.getValidLocation(589) );
assertEquals( 0, of.getIndexFromCoordinate(50) );
assertEquals( 1, of.getIndexFromCoordinate(100) );
- 정모 . . . . 4 matches
[[TableOfContents]]
* on/offline 모임 시간
-> Online (주로 Wiki를 통해 이루어지는) 에서 결정할 내용과 Offline 에서 결정할 내용을 구분하지 못한다.
-> Offline 에서 충분이 결정할 수 있는 일들을 Online(Wiki) 으로 미루어버린다.
See Also HowToDiscussIt
- 3N+1Problem/강희경 . . . . 3 matches
rangeOfMap = aMax - aMin + 1
binaryMap = range(rangeOfMap)
for i in range(rangeOfMap):
- AcceleratedC++/Chapter6/Code . . . . 3 matches
vector<double> medianOfStudents;
transform(students.begin(), students.end(), back_inserter(medianOfStudents), optimistic_median);
return median(medianOfStudents);
- BookShelf/Past . . . . 3 matches
1. SoftwareProjectSurvivalGuide - 20050402
1. Professonal 프로젝트 관리 - 20050502
1. [TheElementsOfProgrammingStyle] - 20051018
1. [JoelOnSoftware] - 20060120
1. [TheElementsOfStyle] - 20060304
1. [IntroductionToTheTheoryOfComputation]
- BusSimulation/상협 . . . . 3 matches
int m_MinuteOfInterval; //버스 배차 간격
m_MinuteOfInterval = 15; //배차 간격 15분
if(i!=0 && m_buses[i-1].GetMinute()==m_MinuteOfInterval) //앞차가 15분이 될때 뒷차 출발
- BusSimulation/태훈zyint . . . . 3 matches
int MinuteOfInterval=12*60; //버스 배차 간격 sec
int LastMovingBusStartTime= -1 * MinuteOfInterval;
&& Now - LastMovingBusStartTime >= MinuteOfInterval) {
- Calendar성훈이코드 . . . . 3 matches
int daysOfMonth(int month, int year);
int day = daysOfMonth(month, year);
int daysOfMonth(int month, int year)
printf("Input the first day of week in January (0:Mon -- 6:Sun)");
- CppStudy_2002_2 . . . . 3 matches
[[TableOfContents]]
|| 7.25 ||["StringOfCPlusPlus"]||11.클래스와 동적 메모리 할당||
|| 문자열 다루기 ||["StringOfCPlusPlus/세연"]|| ||
- Debugging . . . . 3 matches
[[TableOfContents]]
* [http://wiki.kldp.org/wiki.php/HowToBeAProgrammer?action=highlight&value=%B5%F0%B9%F6%B1%EB#s-2.1.1 kldp_HowToBeAProgrammer]
* [http://korean.joelonsoftware.com/Articles/PainlessBugTracking.html 조엘아저씨의 손쉬운 버그 추적법]
- DoItAgainToLearn . . . . 3 matches
제가 개인적으로 존경하는 전산학자 Robert W. Floyd는 1978년도 튜링상 강연 ''[http://portal.acm.org/ft_gateway.cfm?id=359140&type=pdf&coll=GUIDE&dl=GUIDE&CFID=35891778&CFTOKEN=41807314 The Paradigms of Programming]''(일독을 초강력 추천)에서 다음과 같은 말을 합니다. --김창준
Seminar:TheParadigmsOfProgramming DeadLink? - 저는 잘나오는데요. 네임서버 설정이 잘못된건 아니신지.. - [아무개]
In my own experience of designing difficult algorithms, I find a certain technique most helpfult in expanding my own capabilities. After solving a challenging problem, I solve it again from scratch, retracing only the ''insight'' of the earlier solution. I repeat this until the solution is as clear and direct as I can hope for. Then I look for a general rule for attacking similar problems, that ''would'' have led me to approach the given problem in the most efficient way the first time. Often, such a rule is of permanent value. ...... The rules of Fortran can be learned within a few hours; the associated paradigms take much longer, both to learn and to unlearn. --Robert W. Floyd
George Polya는 자신의 책 NoSmok:HowToSolveIt 에서 이런 말을 합니다:
Even fairly good students, when they have obtained the solution of the problem and written down neatly the argument, shut their books and look for something else. Doing so, they miss an important and instructive phase of the work. ... A good teacher should understand and impress on his students the view that no problem whatever is completely exhausted. --George Polya
Seminar:SoftwareDevelopmentMagazine 에서 OOP의 대가 Uncle Bob은 PP와 TDD, 리팩토링에 대한 기사를 연재하고 있다. [http://www.sdmagazine.com/documents/s=7578/sdm0210j/0210j.htm A Test of Patience]라는 기사에서는 몇 시간, 혹은 몇 일 걸려 작성한 코드를 즐겁게 던져버리고 새로 작성할 수도 있다는 DoItAgainToLearn(혹은 {{{~cpp DoItAgainToImprove}}})의 가르침을 전한다.
- Doublets/황재선 . . . . 3 matches
start = wordList.indexOf(word1) + 1;
end = wordList.indexOf(word2) + 1;
if (to == wordList.indexOf(stack.get(stack.size() >= 2?
- EffectiveC++ . . . . 3 matches
[[TableOfContents]]
instead of upper..
=== Item 5: Use the same form in corresponding uses of new and delete ===
* ''Initialization of the pointer in each of the constructors. If no memory is to be allocated to the pointer in a particular constructor, the pointer should be initialized to 0 (i.e., the null pointer). - 생성자 각각에서 포인터 초기화''
* ''Deletion of the existing memory and assignment of new memory in the assignment operator. - 포인터 멤버에 다시 메모리를 할당할 경우 기존의 메모리 해제와 새로운 메모리의 할당''
* ''Deletion of the pointer in the destructor. - 소멸자에서 포인터 삭제''
=== Item 7: Be prepared for out-of-memory conditions. ===
void noMoreMemory(); // decl. of function to
if (size != sizeof (Base)) // size가 잘못 되었으면
if (size != sizeof(Base)) { // if size is "wrong,"
=== Item 9: Avoid hiding the "normal" form of new ===
static unsigned int numberOfTargets()
static unsined int numberOfTanks()
// the Base part of a Derived object is unaffected by this assignment operator.
return "E.H.Gombrich"; // the story of art의 저자
- FocusOnFundamentals . . . . 3 matches
'''Software Engineering Education Can, And Must, Focus On Fundamentals.'''
When I began my EE education, I was surprised to find that my well-worn copy of the "RCA
Tube Manual" was of no use. None of my lecturers extolled the virtues of a particular tube or type
of tube. When I asked why, I was told that the devices and technologies that were popular then
would be of no interest in a decade. Instead, I learned fundamental physics, mathematics, and a
way of thinking that I still find useful today.
learn how to apply what they have been taught. I did learn a lot about the technology of that day in
taught concepts of more lasting value that, even today, help me to understand and use new
Readers familiar with the software field will note that today's "important" topics are not
The many good ideas that underlie these approaches and tools must be taught. Laboratory exercises
to experiment with some new ones. However, we must remember that these topics are today's
of educators to remember that today's students' careers could last four decades. We must identify
the lectures. Many programmes lose sight of the fact that learning a particular system or language
is a means of learning something else, not an goal in itself.
--David Parnas from [http://www.cs.utexas.edu/users/almstrum/classes/cs373/fall98/parnas-crl361.pdf Software Engineering Programmes Are Not Computer Science Programmes]
Students usually demand to be taught the language that they are most likely to use in the world outside (FORTRAN or C). This is a mistake. A well taught student (viz. one who has been taught a clean language) can easily pick up the languages of the world, and he [or she] will be in a far better position to recognize their bad features as he [or she] encounters them.
-- C. H. Lindsey, History of Algol 68. ACM SIGPLAN Notices, 28(3):126, March 1993.
Q: What advice do you have for computer science/software engineering students?
A: Most students who are studying computer science really want to study software engineering but they don't have that choice. There are very few programs that are designed as engineering programs but specialize in software.
I would advise students to pay more attention to the fundamental ideas rather than the latest technology. The technology will be out-of-date before they graduate. Fundamental ideas never get out of date. However, what worries me about what I just said is that some people would think of Turing machines and Goedel's theorem as fundamentals. I think those things are fundamental but they are also nearly irrelevant. I think there are fundamental design principles, for example structured programming principles, the good ideas in "Object Oriented" programming, etc.
- Gnutella-MoreFree . . . . 3 matches
[[TableOfContents]]
|| pong || Ping을 받으면 주소와 기타 정보를 포함해 응답한다.Port / IP_Address / Num Of Files Shared / Num of KB Shared** IP_Address - Big endian||
|| queryHit || 검색 Query 조건과 일치한 경우 QueryHit로 응답한다. Num Of Hits 조건에 일치하는 Query의 결과 수 Port / IP_Address (Big-endian) / Speed / Result Set File Index ( 파일 번호 ) File Size ( 파일 크기 )File Name ( 파일 이 / 더블 널로 끝남 ) Servent Identifier 응답하는 Servent의 고유 식별자 Push 에 쓰인다. ||
// Check for end of reply packet
- Gof/State . . . . 3 matches
[[TableOfContents]]
// send FIN, receive ACK of FIN
이 방법은 HowDraw [Joh92]와 Unidraw [VL90] drawing editor 프레임워크에 이용되었다. 이는 클라이언트로 하여금 새로운 종류의 tool들을 쉽게 정의할 수 있도록 해준다. HowDraw 에서 DrawingController 클래스는 currentTool 객체에게 request를 넘긴다. UniDraw에서는 각각 Viewer 와 Tool 클래스가 이와 같은 관계를 가진다. 다음의 클래스 다이어그램은 Tool 과 DrawingController 인터페이스에 대한 설명이다.
- HowManyFibs?/문보창 . . . . 3 matches
// 10183 - How many Fibs?
[HowManyFibs?]
- HowManyZerosAndDigits/문보창 . . . . 3 matches
// no10061 - How many zeros and how many digits?
double nDigit; // how many digits?
int nZero; // how many zeros?
[HowManyZerosAndDigits] [문보창]
- HowToStudyRefactoring . . . . 3 matches
see also ["HowToStudyDesignPatterns"]
OOP를 하든 안하든 프로그래밍이란 업을 하는 사람이라면 이 책은 자신의 공력을 서너 단계 레벨업시켜 줄 수 있다. 자질구레한 기술을 익히는 것이 아니고 기감과 내공을 증강하는 것이다. 혹자는 DesignPatterns 이전에 ["Refactoring"]을 봐야 한다고도 한다. 이 말이 어느 정도 일리가 있는 것이, 효과적인 학습은 문제 의식이 선행되어야 하기 때문이다. DesignPatterns는 거시적 차원에서 해결안들을 모아놓은 것이다. ["Refactoring"]을 보고 나쁜 냄새(Bad Smell)를 맡을 수 있는 후각을 발달시켜야 한다. ["Refactoring"]의 목록을 모두 외우는 것은 큰 의미가 없다. 그것보다 냄새나는 코드를 느낄 수 있는 감수성을 키우는 것이 더 중요하다. 본인은 일주일에 한 가지씩 나쁜 냄새를 정해놓고 그 기간 동안에는 자신이 접하는 모든 코드에서 그 냄새만이라도 확실히 맡도록 집중하는 방법을 권한다. 일명 ["일취집중후각법"]. 패턴 개념을 만든 건축가 크리스토퍼 알렉산더나 GoF의 랄프 존슨은 좋은 디자인이란 나쁜 것이 없는 상태라고 한다. 무색 무미 무취의 無爲적 自然 코드가 되는 그날을 위해 오늘도 우리는 리팩토링이라는 有爲를 익힌다. -- 김창준, ''마이크로소프트웨어 2001년 11월호''
* Follow ["LawOfDemeter"] : 디미터 법칙을 가능하면 지키려고 한다. 어떤 리팩토링이 저절로 이뤄지거나 필요 없어지는가?
* Separate The What From The How : "어떻게"와 "무엇을"을 분리하도록 하라. 어떤 리팩토링이 창발하는가?
- JTDStudy/첫번째과제/정현 . . . . 3 matches
if(string.contains(String.valueOf(c)))
numbers.add(String.valueOf(i));
return String.valueOf((int)(Math.random()*range));
- Java/CapacityIsChangedByDataIO . . . . 3 matches
Show String Buffer capactity by Data I/O in increment
Show String Buffer capactity by Data I/O in decrement
Show Vector capactity by Data I/O in increment
Show String Buffer capactity by Data I/O in decrement
private int totalNumOfData = 1000000;
showStringBufferIncrease(stringBuffer);
showStringBufferDecrease(stringBuffer);
showVectorIncrease(vector);
showVectorDecrease(vector);
"Show "
size = getShowedString(size, NUMBER_LIMIT_LEN);
capacity = getShowedString(capacity, NUMBER_LIMIT_LEN);
private String getShowedString(String aSrc, int aLimit) {
StringBuffer showedString = new StringBuffer(aLimit);
showedString.append(" ");
showedString.append(aSrc);
return showedString.toString();
public void showStringBufferIncrease(StringBuffer stringBuffer) {
for (int length = 0; length < totalNumOfData; length++) {
public void showStringBufferDecrease(StringBuffer stringBuffer) {
- Java/숫자와문자사이변환 . . . . 3 matches
String str = String.valueOf ( i );
int i = Integer.valueOf ( str ).intValue ( );
double j = Double.valueOf ( str ).doubleValue ( );
- JavaScript/2011년스터디/JSON-js분석 . . . . 3 matches
if (typeof Date.prototype.toJSON !== 'function') {
return isFinite(this.valueOf()) ?
return this.valueOf();
return this.valueOf();
- JollyJumpers/황재선 . . . . 3 matches
|| [[TableOfContents]] ||
int numOfSeries = size - 1;
if (set.size() != numOfSeries) {
- MindMapConceptMap . . . . 3 matches
How To Read a Book 과 같은 책에서도 강조하는 내용중에 '책을 분류하라' 와 '책의 구조를 파악하라'라는 내용이 있다. 책을 분류함으로서 기존에 접해본 책의 종류와 비슷한 방법으로 접근할 수 있고, 이는 시간을 단축해준다. 일종의 知道랄까. 지식에 대한 길이 어느정도 잡혀있는 곳을 걸어가는 것과 수풀을 해치며 지나가는 것은 분명 그 속도에서 차이가 있을것이다.
관련 자료 : 'Learning How To Learn', 'Learning, Creating and Using Knowledge - Concept Maps as Facilitative Tools in Schools and Corporations' (Joseph D. Novak)
See Also ["HowToBuildConceptMap"]
- Monocycle/조현태 . . . . 3 matches
int sumOfCanMove = 0;
++sumOfCanMove;
return sumOfCanMove;
- PatternCatalog . . . . 3 matches
[[TableOfContents]]
* ["Gof/AbstractFactory"]
* ["Gof/Builder"]
* ["Gof/FactoryMethod"]
* ["Gof/Prototype"]
* ["Gof/Singleton"]
* ["Gof/Adapter"]
* ["Gof/Bridge"]
* ["Gof/Composite"]
* ["Gof/Decorator"]
* ["Gof/Facade"]
* ["Gof/Flyweight"]
* ["Gof/Proxy"]
* ["ChainOfResponsibilityPattern"]
* ["Gof/ChainOfResponsibility"]
* ["Gof/Command"]
* ["Gof/Interpreter"]
* ["Gof/Iterator"]
* ["Gof/Mediator"]
* ["Gof/Memento"]
- ProgrammingPartyAfterwords . . . . 3 matches
각 팀별로 전지에 자신들의 디자인을 표현하고 모두에게 그 디자인에 대해 설명하는 식으로 발표를 하였다. 각 팀별 디자인의 특징을 볼 수 있었다. '뭘 잘못했느냐?'가 아니라 '어떻게 해야 잘할 수 있었을까?'와 같은 '올바른 질문'을 던짐으로써 더 배울 수 있다는 것을 확인할 수 있었다. 그리고 발표할때 What 과 How 를 분리하고 What 만을 전달해야 한다는 것이 중요하다는 것을 관찰할 수 있었다.
* NoSmok:StructureAndInterpretationOfComputerPrograms 에 나온 Event-Driven Simulation 방식의 회로 시뮬레이션 [http://mitpress.mit.edu/sicp/full-text/book/book-Z-H-22.html#%_idx_3328 온라인텍스트]
* NoSmok:TheArtOfComputerProgramming 에 나온 어셈블리어로 구현된 엘리베이터 시뮬레이션 (NoSmok:DonaldKnuth 가 직접 엘리베이터를 몇 시간 동안 타보고, 관찰하면서 만든 알고리즘이라고 함. 자기가 타고 다니는 엘리베이터를 분석, 고대로 시뮬레이션 해보는 것도 엄청난 공부가 될 것임)
- ProjectPrometheus/Journey . . . . 3 matches
Object-RDB Mapping 에 대해서는 ["PatternsOfEnterpriseApplicationArchitecture"] 에 나온 방법들을 읽어보고 그중 Data Mapper 의 개념을 적용해보는중. Object 와 DB Layer 가 분리되는 느낌은 좋긴 한데, 처음 해보는것이여서 그런지 상당히 복잡하게 느껴졌다. 일단 처음엔 Data Gateway 정도의 가벼운 개념으로 접근한뒤, Data Mapper 로 꺼내가는게 나았을까 하는 생각.
* Martin Fowler 의 PatternsOfEnterpriseApplicationArchitecture 를 읽어보는중. 우리 시스템의 경우 DataMapper 의 개념과 Gateway 의 개념을 적용해볼 수 있을 것 같다. 전자는 Data Object 를 얻어내는데에 대해 일종의 MediatorPattern 을 적용함. DB 부분과 소켓으로부터 데이터를 얻어올 때 이용할 수 있을 것 같다. 후자의 경우는 일반적으로 Object - RDB Data Mapping (또는 다른 OO 개념이 아닌 데이터들) 인데, RowDataGateway, TableDataGateway 의 경우를 이용할 수 있을것 같다.
* 박성운씨라면 ["SeparationOfConcerns"] 를 늘 언급하시는 분이니; 디자인 정책과 구현부분에 대한 분리에 대해선 저번 저 논문이 언급되었을때 장점에 대해 설명을 들었으니까. 이는 ResponsibilityDrivenDesign 과 해당 모듈 이름을 지을때의 추상화 정도가 지켜줄 수 있을 것이란 막연한 생각중.
- QueryMethod . . . . 3 matches
void makeOff() {
status = "off";
else if( switch->getStatus() == "off" )
light->makeOff();
light->makeOff();
- RSS . . . . 3 matches
{{| [[TableOfContents]] |}}
The technology behind RSS allows you to subscribe to websites that have provided RSS feeds, these are typically sites that change or add content regularly. To use this technology you need to set up some type of aggregation service. Think of this aggregation service as your personal mailbox. You then have to subscribe to the sites that you want to get updates on. Unlike typical subscriptions to pulp-based newspapers and magazines, your RSS subscriptions are free, but they typically only give you a line or two of each article or post along with a link to the full article or post.
The RSS formats provide web content or summaries of web content together with links to the full versions of the content, and other meta-data. This information is delivered as an XML file called RSS feed, webfeed, RSS stream, or RSS channel. In addition to facilitating syndication, RSS allows a website's frequent readers to track updates on the site using a news aggregator.
Before RSS, several similar formats already existed for syndication, but none achieved widespread popularity or are still in common use today, and most were envisioned to work only with a single service. For example, in 1997 Microsoft created Channel Definition Format for the Active Channel feature of Internet Explorer 4.0. Another was created by Dave Winer of UserLand Software. He had designed his own XML syndication format for use on his Scripting News weblog, which was also introduced in 1997 [1].
RDF Site Summary, the first version of RSS, was created by Dan Libby of Netscape in March 1999 for use on the My Netscape portal. This version became known as RSS 0.9. In July 1999 Netscape produced a prototype, tentatively named RSS 0.91, RSS standing for Rich Site Summary, this was a compromise with their customers who argued the complexity introduced (as XML namespaces) was unnecessary. This they considered a interim measure, with Libby suggesting an RSS 1.0-like format through the so-called Futures Document [2].
Soon afterwards, Netscape lost interest in RSS, leaving the format without an owner, just as it was becoming widely used. A working group and mailing list, RSS-DEV, was set up by various users to continue its development. At the same time, Winer posted a modified version of the RSS 0.91 specification - it was already in use in their products. Since neither side had any official claim on the name or the format, arguments raged whenever either side claimed RSS as its own, creating what became known as the RSS fork. [3]
The RSS-DEV group went on to produce RSS 1.0 in December 2000. Like RSS 0.9 (but not 0.91) this was based on the RDF specifications, but was more modular, with many of the terms coming from standard metadata vocabularies such as Dublin Core. Nineteen days later, Winer released RSS 0.92, a minor and (mostly) compatible revision of RSS 0.91. The next two years saw various minor revisions of the Userland branch of RSS, and its adoption by major media organizations, including The New York Times.
Winer published RSS 2.0 in 2002, emphasizing "Really Simple Syndication" as the meaning of the three-letter abbreviation. RSS 2.0 remained largely compatible with RSS 0.92, and added the ability to add extension elements in their own namespaces. In 2003, Winer and Userland Software assigned ownership of the RSS 2.0 specification to his then workplace, Harvard's Berkman Center for the Internet & Society.
[http://www.userland.com UserLand]
- Robbery/조현태 . . . . 3 matches
int numberOfMessage;
scanf("%d", &numberOfMessage);
for (register int i = 0; i < numberOfMessage; ++i)
- Slurpys/곽세환 . . . . 3 matches
temp = str.find_first_not_of('F', 2);
temp = str.find_last_of('C');
temp = str.find_last_of('H');
int numberOfCase;
cin >> numberOfCase;
for (testCase = 0; testCase < numberOfCase; testCase++)
cout << "END OF OUTPUT" << endl;
- SmalltalkBestPracticePatterns/DispatchedInterpretation . . . . 3 matches
'''''How can two objects cooperate when one wishes to conceal its representation ? '''''
Encoding is inevitable in programming. At some point you say, "Here is some information. How am I going to represent it?" This decision to encode information happens a hundred times a day.
Back in the days when data was separated from computation, and seldom the twain should meet, encoding decisions were critical. Any encoding decision you made was propagated to many different parts of the computation. If you got the encoding wrong, the cost of change was enormous. The longer it took to find the mistake, the more ridiculous the bill.
Objects change all this. How you distribute responsibility among objects is the critical decision, encoding is a distant second. For the most part, in well factored programs, only a single object is interested in a piece of information. That object directly references the information and privately performs all the needed encoding and decoding.
Sometimes, however, information in one object must influence the behavior of another. When the uses of the information are simple, or the possible choices based on the information limited, it is sufficient to send a message to the encoded object. Thus, the fact that boolean values are represented as instances of one of two classes, True and False, is hidden behind the message #ifTrue:ifFalse:.
Sets interact with their elements like this. Regardless of how an object is represented, as long it can respond to #=and #hash, it can be put in a Set.
Sometimes, encoding decisions can be hidden behind intermediate objects. And ASCII String encoded as eight-bit bytes hides that fact by conversing with the outside world in terms of Characters:
When there are many different types of information to be encoded, and the behavior of clients changes based on the information, these simple strategies won't work. The problem is that you don't want each of a hundred clients to explicitly record in a case statement what all the types of information are.
For example, consider a graphical Shape represented by a sequence of line, curve, stroke, and fill commands. Regardless of how the Shape is represented internally, it can provide a message #commandAt: anInteger that returns a Symbol representing the command and #argumentsAt: anInteger that returns an array of arguments. We could use these messages to write a PostScriptShapePrinter that would convert a Shape to PostScript:
Every client that wanted to make decisions based on what commands where in a Shape would have to have the same case statement, violating the "once and only once" rule. We need a solution where the case statement is hidden inside of the encoded objects.
The simplest example of this is Collection>>do:. By passing a one argument Block(or any other object that responds to #value:), you are assured that the code will work, no matter whether the Collection is encoded as a linear list, an array, a hash table, or a balanced tree.
This is a simplified case of Dispatched Interpretation because there is only a single message coming back. For the most part, there will be several messages. For example, we can use this pattern with the Shape example. Rather than have a case statement for every command, we have a method in PostScriptShapePrinter for every command, For example:
Rather than Shapes providing #commandAt: and #argumentsAt:, they provide #sendCommantAt: anInteger to: anObject, where #lineFrom:to: is one of the messages that could be sent back. Then the original display code could read:
The name "dispatched interpretation" comes from the distribution of responsibility. The encoded object "dispatches" a message to the client. The client "interprets" the message. Thus, the Shape dispatches message like #lineFrom:to: and #curveFrom:mid:to:. It's up to the clients to interpret the messages, with the PostScriptShapePrinter creating PostScript and the ShapeDisplayer displaying on the screen.
'''''You will have to design a Mediating Protocol of messgaes to be sent back. Computations where both objects have decoding to do need Double Dispatch.'''''
- TheElementsOfProgrammingStyle . . . . 3 matches
TheElementsOfStyle 에 대한 글을 이곳 저곳에서 보면 항상같이 언급되는 책이다. 중앙도서관에 구입신청을 했지만 폐간되어서 입수를 못하고.. 아마존에는 brandnew는 없고 used book만 있다. 각 대학 중앙도서관을 뒤지던 중 연세대와 한양대 중앙도서관에 있음을 알게됨. 우리학교엔 왜 없었던 걸까.
학생들이 TheElementsOfProgrammingStyle 을 공부하면서 TheElementsOfStyle을 언급하였으면 좋겠다. - [임인택]
- UDK/2012년스터디 . . . . 3 matches
[[TableOfContents]]
http://udn.epicgameskorea.com/Three/LandscapeCreatingKR.html
* [박재민] [http://wiki.zeropage.org/wiki.php/UDK/2012%EB%85%84%EC%8A%A4%ED%84%B0%EB%94%94/%EC%86%8C%EC%8A%A4?action=show#s-2 카메라 소스] 분석 중...
[http://wiki.zeropage.org/wiki.php/UDK/2012%EB%85%84%EC%8A%A4%ED%84%B0%EB%94%94/%EC%86%8C%EC%8A%A4?action=show#s-3 간단한 "Hello" + "World" 문자열 연결 Kismet node 예제]
// called when actor landed at FloorActor
event Landed(vector HitNormal, Actor FloorActor);
- UML/CaseTool . . . . 3 matches
[[TableOfContents]]
== Aspects of Functionality ==
''Diagramming'' in this context means ''creating'' and ''editing'' UML [[diagram]]s; that is diagrams that follow the graphical notation of the Unified Modeling Language.
The diagramming part of the Unified Modeling Language seems to be a lesser debated part of the UML, compared to code generation.
The UML diagram notation evolved from elderly, previously competing notations. UML diagrams as a means to draw diagrams of - mostly - [[Object-oriented programming|object oriented]] software is less debated among software developers. If developers draw diagrams of object oriented software, there is widespread consensus ''to use the UML notation'' for that task. On the other hand, it is debated, whether those diagrams are needed at all, on what stage(s) of the software development process they should be used and whether and how (if at all) they should be kept up-to date, facing continuously evolving program code.
''[[Code generation]]'' in this context means, that the user creates UML diagrams, which have some connoted model data, from which the UML tool derives (through a conversion process) parts or all of the [[source code]] for the software system that is to be developed. Often, the user can provide some skeleton of the program source code, in the form of a source code [[template]] where predefined tokens are then replaced with program source code parts, emitted by the UML tool during the code generation process.
There is some debate among software developers about how useful code generation as such is. It certainly depends on the specific problem domain and how far code generation should be applied. There are well known areas where code generation is an established practice, not limited to the field of UML. On the other hand, the idea of completely leaving the "code level" and start "programming" on the UML diagram level is quite debated among developers, and at least, not in such widespread use compared to other [[software development]] tools like [[compiler]]s or [[Configuration management|software configuration management systems]]. An often cited criticism is that the UML diagrams just lack the detail which is needed to contain the same information as is covered with the program source. There are developers that even state that "the Code ''is'' the design" (articles [http://www.developerdotstar.com/mag/articles/reeves_design_main.html] by Jack W. Reeves [http://www.bleading-edge.com/]).
Reverse engineering encloses the problematic, that diagram data is normally not contained with the program source, such that the UML tool, at least in the initial step, has to create some ''random layout'' of the graphical symbols of the UML notation or use some automatic ''layout algorithm'' to place the symbols in a way that the user can understand the diagram. For example, the symbols should be placed at such locations on the drawing pane that they don't overlap. Usually, the user of such a functionality of an UML tool has to manually edit those automatically generated diagrams to attain some meaningfulness. It also often doesn't make sense to draw diagrams of the whole program source, as that represents just too much detail to be of interest at the level of the UML diagrams. There are also language features of some [[programming language]]s, like ''class-'' or ''function templates'' of the programming language [[C plus plus|C++]], which are notoriously hard to convert automatically to UML diagrams in their full complexity.
== List Of UML Case Tool ==
- [http://en.wikipedia.org/wiki/List_of_UML_tools]
Rational Software Architect, Together가 유명하고, 오픈 소스로는 Argo, Violet 이 유명하다.
- Unicode . . . . 3 matches
[[TableOfContents]]
{{{In computing, Unicode provides an international standard which has the goal of providing the means to encode the text of every document people want to store on computers. This includes all scripts in active use today, many scripts known only by scholars, and symbols which do not strictly represent scripts, like mathematical, linguistic and APL symbols.
Establishing Unicode involves an ambitious project to replace existing character sets, many of them limited in size and problematic in multilingual environments. Despite technical problems and limitations, Unicode has become the most complete character set and one of the largest, and seems set to serve as the dominant encoding scheme in the internationalization of software and in multilingual environments. Many recent technologies, such as XML, the Java programming language as well as several operating systems, have adopted Unicode as an underlying scheme to represent text.
official consortium : [http://www.unicode.org]
js 등에서 indexOf() 로 가져오면 UCS-4 코드가 10진수로 반환됩니다.
앞에 0 을 적지 않았기 때문에 (Zerofill 이 아니기 때문에) 4자리까지는 UCS-2 려니 하시고,
* [http://www.joelonsoftware.com/articles/Unicode.html]
- XMLStudy_2002/XML+CSS . . . . 3 matches
[[TableOfContents]]
<MYDOC xmlns:HTML="http://www.w3.org/Profiles/XHTML-transitional">
<HTML:A href="http://msdn.microsoft.com/xml/xslguide/browsing-css.asp">How to Write a CSS StyleSheet for Browsing XML</HTML:A>
<MYDOC xmlns:HTML="http://www.w3.org/Profiles/XHTML-transitional">
[1]<HTML:A href="http://msdn.microsoft.com/xml/xslguide/browsing-css.asp ">
How to Write a CSS Style Sheet for Browsing XML</HTML:A>
[2]<HTML:A href="http://msdn.microsoft.com/xml/xslguide/browsing-overview.asp">
[3]<HTML:A href="http://msdn.microsoft.com/xml/samples/review/review-css.xml">
[4]<HTML:A href="http://msdn.microsoft.com/xml/samples/review/review-xsl.xml">
- ZP도서관 . . . . 3 matches
[[TableOfContents]]
|| HOW TO SOLVE IT || .............. || erunc0 || ? ||
|| The Art of Assembly 2nd Edition || Randall Hyde || Not printed yet || http://webster.cs.ucr.edu/ || 프로그래밍언어 ||
|| Software Engineering || Ian Sommerville || Addison-Wesley || 도서관 소장 || SE ||
|| Learning How To Learn || Joseph D. Novak || Cambridge University Press || 도서관 소장 || 학습기법관련 ||
|| How To Read a Book || Adler, Morimer Jero || Simon and Schuster || 도서관 소장(번역판 '논리적독서법' 도서관 소장, ["1002"] 소유. 그 외 번역판 많음) || 독서기법관련 ||
- ZeroPageEvents . . . . 3 matches
|| 4.11. 2002 || ["SeminarHowToProgramIt"] || . || 세미나 & 진행 : ["JuNe"][[BR]] 참가 : 이선우, ["woodpage"], ["물푸"], ["1002"], ["상협"], ["[Lovely]boy^_^"], ["neocoin"], ["구근"], ["comein2"], ["zennith"], ["fnwinter"], ["신재동"], ["창섭"], ["snowflower"], ["이덕준"], 채희상, 임차섭, 김형용, 김승범, 서지원, 홍성두 [[BR]] 참관: ["최태호"], ["nautes"], ["JihwanPark"], 최유환, 이한주, 김정준, 김용기 ||
|| 5.19. 2002 || ["프로그래밍파티"] || 서강대 ["MentorOfArts"] 팀과의 ["ProgrammingContest"] || ZeroPagers : ["1002"], ["이덕준"], ["nautes"], ["구근"], ["[Lovely]boy^_^"], ["창섭"], ["상협"] [[BR]] 외부 : ["JuNe"], ["MentorOfArts"] Team ||
- [Lovely]boy^_^/Diary/2-2-9 . . . . 3 matches
[[TableOfContents]]
* ["TheWarOfGenesis2R"] 시작
* ["TheWarOfGenesis2R"] Start
* I'll delight The AcceleratedC++, that I summary on wiki pages is helpful for beginner of C++.
* This meeting is also helpful. Although a half of members don't attend, I can think many new things.
- [Lovely]boy^_^/EnglishGrammer/Passive . . . . 3 matches
[[TableOfContents]]
B. When we use the passive, who or what causes the action is often unknown or unimportant.(그리니까 행위주체가 누군지 모를때나 별로 안중요할때 수동태 쓴대요)
ex) A lot of money was stolen in the robbery.
ex) How many babies are born every day?
B. Some verbs can have two objects(ex : give, ask, offer, pay, show, teach, tell)
When we use these verbs in the passive, most often we begin with the person.
ex) You will be given plenty of time to decide.(= We will give you plenty of time)
C. The passive of doing/seeing -> being done/being seen
D. Get : Sometimes you can use get instead of be in the passive:
A. ex) Henry is very old. Nobody knows exactly how old he is, but :
We can use these structures with a number of other verbs
ex) Mark is supposed to have kicked a police officer.( = he is said to have kicked)
= it is planned, arranged, or expected. Often this is different from what really happens
A. The roof of Lisa's house was damaged in a storm, so she arranged for somebody to repair it. Yesterday a worker came and did the job.
Lisa 'had the roof repaired' yesterday.
This means : Lisa arranged for somebody else to repair the roof. She didn't repair it herself.
- [Lovely]boy^_^/EnglishGrammer/PresentPerfectAndPast . . . . 3 matches
[[TableOfContents]]
We often use the present perfect to give new information or to announce a recent happening.(새로운 정보나, 최근의 사건을 보도할때도 쓰인답니다.)
C. We ofte use the present perfect with just, already, and yet. You can also use the simple past.
Yet = until now. It shows that the speaker is expecting something to happen. Use yet only in questions and negative sentences.
A. When we talk about a period of time that continues from the past until now, we use the present perfect.(앞에 나온말)
Here are more examples of speakers talking about a period that continues until now(recently/ in the last few days/ so far/ since breakfast, etc.)
B. We use the present perfect with today/ this morning/ this evening, etc. when these periods are not finished at the time of speaking.(그렇대요;;)
== Unit11. How long have you (been) ...? ==
== Unit12. For and since, When ...?, and How long ...? ==
- callusedHand . . . . 3 matches
[[TableOfContents]]
''DeleteMe) 처음 독서 방법에 대한 책에 대해 찾아봤었을때 읽었었던 책입니다. 당연한 말을 하는 것 같지만, 옳은 말들이기 때문에 당연한 말을 하는 교과서격의 책이라 생각합니다. 범우사꺼 얇은 책이라면 1판 번역일 것이고, 2판 번역과 원서 (How To Read a Book)도 도서관에 있습니다. --석천''
''(move to somewhere appropriate plz) 논리학 개론 서적으로는 Irving Copi와 Quine의 서적들(특히 Quine의 책은 대가의 면모를 느끼게 해줍니다), Smullyan의 서적들을 권하고, 논리학에서 특히 전산학과 관련이 깊은 수리논리학 쪽으로는 Mendelson이나 Herbert Enderton의 책을 권합니다. 또, 증명에 관심이 있다면 How to Prove It을 권합니다. 대부분 ["중앙도서관"]에 있습니다. (누가 신청했을까요 :) ) --JuNe''
- html5/canvas . . . . 3 matches
[[TableOfContents]]
* shadowOffsetX
* shadowOffsetY
- snowflower . . . . 3 matches
[[TableOfContents]]
= Profile =
||[TheWarOfGenesis2R]||창세기전2 리메이크 프로젝트|| _ ||
||["SRPG제작"]||SRPG에 대한 대략적인 계획 - 현재는 ["TheWarOfGenesis2R"]과 함께|| _ ||
||[GalzooIsland]||일본어 (With S.D.)|| 2006.01 ~ 중도하차||
- 고전모으기 . . . . 3 matches
* StructuredProgramming, TheElementsOfProgrammingStyle, SICP, SmalltalkByExample, SmalltalkBestPracticePatterns
* TheArtOfComputerProgramming
TheElementsOfStyle, WomenFireAndDangerousThings, MetaphorsWeLiveBy
- 데블스캠프2011/셋째날/String만들기/김준석 . . . . 3 matches
int offset;
offset = 0;
offset = 0;
String(const String& str, const int offset,const int count){
if(offset >= str.count){
this->value = str.value + offset;
this->offset = 0;
int indexOf(String& str){
int lastIndexOf(String& str){
String * subString(int offset, int count){
char * offvalue = this->value+ offset;
*(temp + i) = *(offvalue+i);
char * temp = this->value + this->offset;
char * temp2 = str.value + str.offset;
//cout << s->lastIndexOf(*s2) << endl;
- 디자인패턴 . . . . 3 matches
[[TableOfContents]]
HowToStudyDesignPatterns 페이지를 참조하세요.
* http://www.econ.kuleuven.ac.be/tew/academic/infosys/Members/Snoeck/litmus2.ps - Design Patterns As Litmus Paper To Test The Strength Of Object Oriented Methods
- 문제풀이게시판 . . . . 3 matches
|| [[TableOfContents]] ||
* NoSmok:HowToSolveIt
see also HowToStudyDataStructureAndAlgorithms
- 새싹교실/2011/學高/8회차 . . . . 3 matches
int numOfRings;
scanf("%d",&numOfRings);
hanoi('A','C','B',numOfRings);
- 스터디그룹패턴언어 . . . . 3 matches
[[TableOfContents]]
기념비적인 책, ''A Pattern Language'' 와 ''A Timeless Way Of Building''에서 크리스토퍼 알렉산더와 그의 동료들이 패턴언어에 대한 아이디어를 세상에 소개했다. 패턴언어는 어떤 주제에 대해 포괄적인 방안을 제공하는, 중요한 관련 아이디어의 실질적인 네트워크이다. 그러나 패턴언어가 포괄적이긴 하지만, 전문가를 위해 작성되지 않았다. 패턴은 개개인의 독특한 방식으로 양질의 성과를 얻을 수 있도록 힘을 줌으로서 전문적 해법을 비전문가에게 전해준다.
본 패턴언어에는 21가지 패턴이 있다. '정신', '분위기', '역할' 그리고 '맞춤'(Custom)이라고 부르는 네 섹션으로 구분된다. 해당 섹션의 패턴을 공부할 때, 이 언어의 구조를 고려하라. 본 언어의 앞 부분인 '정신' 섹션의 패턴은 스터디 그룹의 핵심 즉, 배움의 정신(spirit of learning)을 정의하는 것을 도와 줄 것이다. 다음 섹션 '분위기', '역할', '맞춤'은 앞선 핵심 패턴과 깊이 얽혀있으며 그것들을 상기시켜줄 것이다.
* [통찰력풀패턴](PoolOfInsightPattern)
Follow customs that will re-enforce the spirit of the group, piquing participant's interest in dialogues, accommodating different learning levels, making the study of literature easier, recording group experiences, and drawing people closer together.
- 정모/2012.4.2 . . . . 3 matches
[[TableOfContents]]
* 위키에서 이런걸 발견했다. [http://wiki.zeropage.org/wiki.php/HowToStudyInGroups HowToStudyInGroups] 링크의 제목이 슬프다 - [서지혜]
- 2006김창준선배창의세미나 . . . . 2 matches
[[TableOfContents]]
= Play With Many Boxes =
* 보통 창의적인것을 하려고 할때 Out of the one box 식으로 하려는 경향이 있는데 그게 아니라 여러 box 를 가지고 노는 과정에서 창의력을 올려 보자.
- ACM_ICPC . . . . 2 matches
* [http://icpckorea.org/2019/regional/scoreboard/ 2019년 스탠딩] - TheOathOfThePeachGarden Rank 81(CAU - Rank 52, including Abroad team)
* team 'TheOathOfThePeachGarden' 본선 81위(학교 순위 52위) : [한재현], [김영기], [오준석]
- BigBang . . . . 2 matches
[[TableOfContents]]
* void pointer 사용 자제합시다. void pointer가 가리키는 값의 타입을 추론할 수 없다. [http://stackoverflow.com/questions/1718412/find-out-type-of-c-void-pointer 참고]
* template와 friend 사이에 여러 매핑이 존재한다. many to many, one to many, many to one, one to one : [http://publib.boulder.ibm.com/infocenter/comphelp/v7v91/index.jsp?topic=%2Fcom.ibm.vacpp7a.doc%2Flanguage%2Fref%2Fclrc16friends_and_templates.htm 참고]
* 참고 : http://www.hackerschool.org/HS_Boards/data/Lib_system/The_Mystery_of_Format_String_Exploitation.pdf
* arr.size()는 녕원히 0이 되지 않는다.. naver.. i가 5일 때 ArrayIndexOutOfBounds Exception이 발생한다
b = (Line *)malloc(sizeof(Line));
- BookShelf . . . . 2 matches
1. ConceptsOfProgrammingLanguages
1. [TheElementsOfStyle] 4e
Art of UNIX Programming
- C++Analysis . . . . 2 matches
[[TableOfContents]]
["프로젝트분류"], ["SecretAndTrueOfC++"]
- Class/2006Fall . . . . 2 matches
[[TableOfContents]]
* 1st presentation of project is on 28 Sep. - 초기 진행 상황 및 향후 계획
* 2nd presentation of project is on 12 Oct. - 검색 (설계 및 구현)
* 3rd presentation of project is on 31 Oct. - 변경 (설계 및 구현)
* 4th presentation of project is on 14 Nov. - API, 성능평가
* Write answer to one of question in Q&A chapter 6.
* Write answer that consist five or six sentenses to one of question in Q&A chapter 7.
* Offline meeting at 11 a.m. on 10 Nov.
* Show the result on 18 Nov
- ComputerNetworkClass/Exam2006_2 . . . . 2 matches
[[TableOfContents]]
일반적인 메일 전송 프로토콜의 이해와 MIME 프로토콜에 대한 간단한 이해. 그리고 E(MD(5), PrivateKeyOfSnd) 의 해석 방법과 계층적 인증에 대한 이해를 묻는 문제였음.
- CppUnit . . . . 2 matches
[http://janbyul.com/moin/moin.cgi/CppUnit/HowTo/Kor 이곳]에 VS2005용 설정방법을 간단하게 정리해둠. - 임인택
|| [[TableOfContents]] ||
2) Questions related to Microsoft Visual VC++
- DataCommunicationSummaryProject/Chapter8 . . . . 2 matches
[[TableOfContents]]
* POP(Post Office Protocol) : 한번 본 이메일은 서버에서 지워진다.
- DataStructure . . . . 2 matches
[[TableOfContents]]
see also HowToStudyDataStructureAndAlgorithms
- DesignPattern2006 . . . . 2 matches
[[TableOfContents]]
|| 9/22 || GOF의 DesignPatterns 읽기 || . ||
|| 10/13 || GOF의 DesignPatterns 읽기 2 || . ||
* GOF 의 디자인 패턴
* [HowToStudyDesignPatterns]
* [http://www.tml.tkk.fi/~pnr/GoF-models/html/]
* 음... GOF의 디자인페턴 책 오늘정도 올꺼 같은데...;; - [상욱]
- DirectDraw/DDUtil . . . . 2 matches
[[TableOfContents]]
["TheWarOfGenesis2R"]페이지의 개설에 따라 사용법을 모읍니다.
ShowBitmap(HBITMAP hbm, LPDIRECTDRAWPALETTE pPalette)
- DocumentObjectModel . . . . 2 matches
{{| [[TableOfContents]] |}}
Different variants of DOMs were initially implemented by web browsers to manipulate elements in an HTML document. This prompted the World Wide Web Consortium (W3C) to come up with a series of standard specifications for DOM (hence called W3CDOM).
Most XML parsers (e.g., Xerces) and XSL processors (e.g., Xalan) have been developed to make use of the tree structure. Such an implementation requires that the entire content of a document be parsed and stored in memory. Hence, DOM is best used for applications where the document elements have to be randomly accessed and manipulated. For XML-based applications which involve a one-time selective read/write per parse, DOM presents a considerable overhead on memory. The SAX model is advantageous in such a case in terms of speed and memory consumption.
DOM API 쓰는 코드와 SAX API 쓰는 코드는 [http://www.python.or.kr/pykug/XML_bf_a1_bc_ad_20_c7_d1_b1_db_20_c3_b3_b8_ae_c7_cf_b1_e2 XML에서 한글 처리하기] 페이지중 소스코드를 참조. XPath 는 PyKug:HowToUseXPath 를 참조. --[1002]
- EnglishSpeaking/2012년스터디 . . . . 2 matches
[[TableOfContents]]
= How to =
@ Toz Kangnam 2nd office
* We listened audio file and read part of script by taking role.(And after reading script once, we also change our role and read script again.)
* 2nd time of ESS! Our English speaking ability is not growing visibly but that's OK. It's just 2nd time. But we need to study everyday for expanding our vocabulary and increasing our ability rapidly. Thus I'll memorize vocabulary and study with basic English application(It's an android application. I get it for FREE! YAY!) I wish I can speak English more fluent in our 20th study. XD
* Today, we were little confused by Yunji's appearance. We expected conversation between 2 persons but there were 3 persons who take part in episode 2. And we made a mistake about deviding part. Next time, when we get 3 persons' conversation again, we should pay attention to devide part equally. Or we can do line by line reading instead of role playing.
- EnglishSpeaking/TheSimpsons/S01E02 . . . . 2 matches
Marge : All right. Mmm. How about "he"? Two points. Your turn, dear.
Homer : Hmm. How could anyone make a word out of these lousy letters?
Marge : I think it's under the short leg of the couch.
one of three components of the psyche."
Homer : I'll show you a big, dumb, balding ape!
- FoundationOfUNIX . . . . 2 matches
[[TableOfContents]]
= Foundation Of UNIX =
- GRASP . . . . 2 matches
[[TableOfContents]]
Pluggable Software Component
PV와 관련된 다양한 기법들이 있는데 그중 하나가 [LawOfDemeter]라는군요. :)
- GTK+ . . . . 2 matches
GTK+ is a multi-platform toolkit for creating graphical user interfaces. Offering a complete set of widgets, GTK+ is suitable for projects ranging from small one-off projects to complete application suites.
GTK+ is free software and part of the GNU Project. However, the licensing terms for GTK+, the GNU LGPL, allow it to be used by all developers, including those developing proprietary software, without any license fees or royalties.
GLib is the low-level core library that forms the basis of GTK+ and GNOME. It provides data structure handling for C, portability wrappers, and interfaces for such runtime functionality as an event loop, threads, dynamic loading, and an object system.
Pango is a library for layout and rendering of text, with an emphasis on internationalization. It forms the core of text and font handling for GTK+-2.0.
The ATK library provides a set of interfaces for accessibility. By supporting the ATK interfaces, an application or toolkit can be used with such tools as screen readers, magnifiers, and alternative input devices.
GTK+ has been designed from the ground up to support a range of languages, not only C/C++. Using GTK+ from languages such as Perl and Python (especially in combination with the Glade GUI builder) provides an effective method of rapid application development.
gtk_widget_show(button);
gtk_widget_show(window);
- Gof/Command . . . . 2 matches
[[TableOfContents]]
THINK 클래스 라이브러리 [Sym93b] 또한 undo 가능한 명령을 지원하기 위해 CommandPattern을 사용한다. THINK 에서의 Command들은 "Tasks" 로 불린다. Task 객체들은 ChainOfResponsibilityPattern에 입각하여 넘겨지고 소비되어진다.
- Gof/Composite . . . . 2 matches
[[TableOfContents]]
Another example of this pattern occurs in the financial domain, where a portfolio aggregates individual assets. You can support complex aggregations of assets by implementing a portfolio as a Composite that conforms to the interface of an individual asset [BE93].
* 종종 컴포넌트-부모 연결은 ChainOfResponsibilityPattern에 이용된다.
- Gof/FactoryMethod . . . . 2 matches
[[TableOfContents]]
A potential disadvantage of factory methods is that clients might have to subclass the Creator class just to create a particular ConcreteProduct object. Subclassing is fine when the client has to subclass the Creator class anyway, but otherwise the client now must deal with another point of evolution.
Here are two additional consequences of the Factory Method pattern:
MyCreator::Create handles only YOURS, MINE, and THEIRS differently than the parent class. It isn't interested in other classes. Hence MyCreator extends the kinds of products created, and it defers responsibility for creating all but a few products to its parent.
You can avoid this by being careful to access products solely through accessor operations that create the product on demand. Instead of creating the concrete product in the constructor, the constructor merely initializes it to 0. The accessor returns the product. But first it checks to make sure the product exists, and if it doesn't, the accessor creates it. This technique is sometimes called lazy initialization. The following code shows a typical implementation:
4. Using templates to avoid subclassing. As we've mentioned, another potential problem with factory methods is that they might force you to subclass just to create the appropriate Product objects. Another way to get around this in C++ is to provide a template subclass of Creator that's parameterized by the Product
With this template, the client supplies just the product class?no subclassing of Creator is required.
The function CreateMaze (page 84) builds and returns a maze. One problem with this function is that it hard-codes the classes of maze, rooms, doors, and walls. We'll introduce factory methods to let subclasses choose these components.
Each factory method returns a maze component of a given type. MazeGame provides default implementations that return the simplest kinds of maze, rooms, walls, and doors.
Different games can subclass MazeGame to specialize parts of the maze. MazeGame subclasses can redefine some or all of the factory methods to specify variations in products. For example, a BombedMazeGame can redefine the Room and Wall products to return the bombed varieties:
Class View in the Smalltalk-80 Model/View/Controller framework has a method defaultController that creates a controller, and this might appear to be a factory method [Par90]. But subclasses of View specify the class of their default controller by defining defaultControllerClass, which returns the class from which defaultController creates instances. So defaultControllerClass is the real factory method, that is, the method that subclasses should override.
A more esoteric example in Smalltalk-80 is the factory method parserClass defined by Behavior (a superclass of all objects representing classes). This enables a class to use a customized parser for its source code. For example, a client can define a class SQLParser to analyze the source code of a class with embedded SQL statements. The Behavior class implements parserClass to return the standard Smalltalk Parser class. A class that includes embedded SQL statements overrides this method (as a class method) and returns the SQLParser class.
The Orbix ORB system from IONA Technologies [ION94] uses Factory Method to generate an appropriate type of proxy (see Proxy (207)) when an object requests a reference to a remote object. Factory Method makes it easy to replace the default proxy with one that uses client-side caching, for example.
Abstract Factory (87) is often implemented with factory methods. The Motivation example in the Abstract Factory pattern illustrates Factory Method as well.
Prototypes (117) don't require subclassing Creator. However, they often require an Initialize operation on the Product class. Creator uses Initialize to initialize the object. Factory Method doesn't require such an operation.
- HelpOnMacros . . . . 2 matches
[[TableOfContents]]
||{{{[[TableOfContents]]}}} || 목차 매크로 || 현재 보고계신 페이지에서 사용중입니다. ||
- HolubOnPatterns/밑줄긋기 . . . . 2 matches
[[TableOfContents]]
* 인터페이스 관점에서 프로그래밍 하는 것은 OO 시스템의 기본 개념이며 GoF와 디자인 패턴은 이의 구체적이 예가 된다.
* 깨지기 쉬운 기반 클래스 문제를 프레임워크 기반 프로그래밍에 대한 언급 없이 마칠 수는 없다. MFC(Microsoft's Foundation Class) 라이브러리와 같은 프레임워크는 클래스 라이브러리를 만드는 인기있는 방법이 되었다.
* Clock이 전형적인 GoF Singleton 임을 주의 깊게 보기 바란다.
* 어투는 좀 잘못된 Trade-Off라고 하는듯 하다. - [김준석]
- HowBigIsIt? . . . . 2 matches
=== HowBigIsIt? ===
|| 하기웅 || C++ || 완전 틀렸음ㅋㅋ || [HowBigIsIt?/하기웅] ||
- HowManyPiecesOfLand?/하기웅 . . . . 2 matches
BigInteger Piece_of_Land(BigInteger n)
cout << Piece_of_Land(input) << endl;
- HowManyZerosAndDigits/허아영 . . . . 2 matches
//HowManyZerosAndDigits
- HowToDiscussIt . . . . 2 matches
'''Separate What From How'''
* NoSmok:HowToMakeMeetingsWork
- HowToStudyDataStructureAndAlgorithms . . . . 2 matches
알고리즘을 공부하면 큰 줄기들을 알아야 합니다. 개별 테크닉들도 중요하지만 "패러다임"이라고 할만한 것들을 알아야 합니다. 그래야 알고리즘을 상황에 맞게 마음대로 응용할 수 있습니다. 또, 자신만의 분류법을 만들어야 합니다. (see also HowToReadIt Build Your Own Taxonomy) 구체적인 문제들을 케이스 바이 케이스로 여럿 접하는 동안 그냥 지나쳐 버리면 개별자는 영원히 개별자로 남을 뿐입니다. 비슷한 문제들을 서로 묶어서 일반화를 해야 합니다. (see also DoItAgainToLearn)
이와 관련해서 Anany Levitin의 ''A NEW ROAD MAP OF ALGORITHM DESIGN TECHNIQUES''(DDJ, 2000 Apr)를 권합니다. 그는 알고리즘 디자인 테크닉을 다음 네가지로 크게 나눕니다:
see also ["HowToStudyDesignPatterns"]
- JTDStudy/첫번째과제/원명 . . . . 2 matches
JOptionPane.showMessageDialog(null, (result / 10) + " Strike, "
String input = JOptionPane.showInputDialog("Enter three different number\n");
JOptionPane.showMessageDialog(null, "You are right!\n Answer is " + correctNumber);
throw new IndexOutOfBoundsException("pos값은 1이상을 넣어주세요.");
JOptionPane.showMessageDialog(null,
.showInputDialog("Enter three different number\n");
throw new IndexOutOfBoundsException("pos값은 1이상");
JOptionPane.showMessageDialog(null, "You are right!\n Answer is "
- JavaNetworkProgramming . . . . 2 matches
[[TableOfContents]]
while((numberRead =System.in.read(buffer))>=0) //가능한 많은 양을 읽는다. EOF가 -1을 반환하면 출력한다.
while((numberRead = in.read(buffer)) >=0) //파일을 버퍼에 가능한 많은 양을 읽고 읽은 양만큼 파일에 쓴다. 파일이 EOF일 때까지.
private int offset,length,port;
offset = packet.getOffset();
return new DatagramPacket(data,offset,length,address,port);
if(object instanceof MyDatagramPacket)
- JavaScript/2011년스터디/URLHunter . . . . 2 matches
var CrtURL = (document.URL.indexOf('#') == -1)? document.URL+'#': document.URL.slice(0,document.URL.indexOf('#')+1);
- KDPProject . . . . 2 matches
[[TableOfContents]]
["PatternCatalog"] - ["PatternCatalog"] 에서는 GoF 책 정리중.
*["HowToStudyDesignPatterns"] - DP 를 공부하기 전에 생각해볼 수 있는 이야기들.
* http://c2.com/cgi/wiki?PortlandPatternRepository - Portland Pattern Repository. 유명한 Wiki page.
* ftp://ftp.aw.com/cp/Gamma/dp.zip.gz - Design Pattern GoF.
* http://www.plasticsoftware.com/ - 국산 Java case tool pLASTIC
- LIB_3 . . . . 2 matches
TCB[count].StackOff = NULL;
pReady_heap[ready_tcb_ptr]->StackOff = INT16U(Stack) - 28;
- LearningGuideToDesignPatterns . . . . 2 matches
CompositePattern은 여러부분에서 나타나며, IteratorPattern, ChainOfResponsibilityPattern, InterpreterPattern, VisitorPattern 에서 종종 쓰인다.
=== Chain of Responsibility - Behavioral ===
ObserverPattern 과 MediatorPattern 들을 이용한 message의 전달관계를 관찰하면서, ChainOfResponsibilityPattern 의 message handling 과 비교 & 대조할 수 있다.
- Linux/필수명령어/용법 . . . . 2 matches
chown
- chown [ -cfvR ] 사용자 파일명(들)
- $ chown blade /user/sisap/*
만일 중간에 다른 점을 발견한다면 더 이상의 작업은 중단하고 차이를 발견한 지점을 알려주고는 종료한다. 또한 계속해서 일치해 나가다가 두 파일 중 어느 하나가 끝나는 경우가 있을 수 있다. 다시 말해, 한 파일이 다른 파일의 앞부분에 해당하는 경우이다. 이때는 어느쪽 파일의 end of file 표시를 만나게 되었는지를 알려주고 종료한다.
- Login Name Tty Idle Login Time Office Office Phone
-26) SIGVTALRM 27) SIGPROF 28) SIGWINCH 29) SIGIO
readme.txt의 파일에서 캐리지 리턴 문자와 eof마크를 제거하고 readable파일로 리다이렉션한다.
- LispLanguage . . . . 2 matches
[[TableOfContents]]
* emacs 강좌 - lisp 이해하기 1: http://ageofblue.blogspot.kr/2012/01/emacs-lisp-1.html
* [http://dept-info.labri.fr/~strandh/Teaching/Programmation-Symbolique/Common/David-Lamkins/contents.html Successful Lisp:How to Understand and Use Common Lisp] - 책인듯(some 에 대한 설명 있음)
- MFC/Print . . . . 2 matches
{{| [[TableOfContents]] |}}
|| m_nOffsetPage || m_bDocObject가 TRUE일때만 유효. lPrint job 안에서 첫번째 페이지 offset을 준다. ||
- Microsoft . . . . 2 matches
{{|[[TableOfContents]]|}}
= Microsoft =
{{|Microsoft Corporation (NASDAQ: MSFT) is the world's largest software company, with over 50,000 employees in various countries as of May 2004. Founded in 1975 by Bill Gates and Paul Allen, it is headquartered in Redmond, Washington, USA. Microsoft develops, manufactures, licenses, and supports a wide range of software products for various computing devices. Its most popular products are the Microsoft Windows operating system and Microsoft Office families of products, each of which has achieved near ubiquity in the desktop computer market.|}}
- MineSweeper/곽세환 . . . . 2 matches
int findNumberOfMine(char input[][100], int n, int m, int y, int x)
output[i][j] = findNumberOfMine(input, n, m, i, j) + '0';
- MoreEffectiveC++/Appendix . . . . 2 matches
[[TableOfContents]]
So your appetite for information on C++ remains unsated. Fear not, there's more — much more. In the sections that follow, I put forth my recommendations for further reading on C++. It goes without saying that such recommendations are both subjective and selective, but in view of the litigious age in which we live, it's probably a good idea to say it anyway. ¤ MEC++ Rec Reading, P2
There are hundreds — possibly thousands — of books on C++, and new contenders join the fray with great frequency. I haven't seen all these books, much less read them, but my experience has been that while some books are very good, some of them, well, some of them aren't. ¤ MEC++ Rec Reading, P4
What follows is the list of books I find myself consulting when I have questions about software development in C++. Other good books are available, I'm sure, but these are the ones I use, the ones I can truly recommend. ¤ MEC++ Rec Reading, P5
A good place to begin is with the books that describe the language itself. Unless you are crucially dependent on the nuances of the °official standards documents, I suggest you do, too. ¤ MEC++ Rec Reading, P6
* '''''The Design and Evolution of C++''''', Bjarne Stroustrup, Addison-Wesley, 1994, ISBN 0-201-54330-3. ¤ MEC++ Rec Reading, P8
These books contain not just a description of what's in the language, they also explain the rationale behind the design decisions — something you won't find in the official standard documents. The Annotated C++ Reference Manual is now incomplete (several language features have been added since it was published — see Item 35) and is in some cases out of date, but it is still the best reference for the core parts of the language, including templates and exceptions. The Design and Evolution of C++ covers most of what's missing in The Annotated C++ Reference Manual; the only thing it lacks is a discussion of the Standard Template Library (again, see Item 35). These books are not tutorials, they're references, but you can't truly understand C++ unless you understand the material in these books
For a more general reference on the language, the standard library, and how to apply it, there is no better place to look than the book by the man responsible for C++ in the first place: ¤ MEC++ Rec Reading, P10
Stroustrup has been intimately involved in the language's design, implementation, application, and standardization since its inception, and he probably knows more about it than anybody else does. His descriptions of language features make for dense reading, but that's primarily because they contain so much information. The chapters on the standard C++ library provide a good introduction to this crucial aspect of modern C++. ¤ MEC++ Rec Reading, P12
If you're ready to move beyond the language itself and are interested in how to apply it effectively, you might consider my other book on the subject: ¤ MEC++ Rec Reading, P13
Murray's book is especially strong on the fundamentals of template design, a topic to which he devotes two chapters. He also includes a chapter on the important topic of migrating from C development to C++ development. Much of my discussion on reference counting (see Item 29) is based on the ideas in C++ Strategies and Tactics.
If you're the kind of person who likes to learn proper programming technique by reading code, the book for you is ¤ MEC++ Rec Reading, P19
Each chapter in this book starts with some C++ software that has been published as an example of how to do something correctly. Cargill then proceeds to dissect — nay, vivisect — each program, identifying likely trouble spots, poor design choices, brittle implementation decisions, and things that are just plain wrong. He then iteratively rewrites each example to eliminate the weaknesses, and by the time he's done, he's produced code that is more robust, more maintainable, more efficient, and more portable, and it still fulfills the original problem specification. Anybody programming in C++ would do well to heed the lessons of this book, but it is especially important for those involved in code inspections. ¤ MEC++ Rec Reading, P21
One topic Cargill does not discuss in C++ Programming Style is exceptions. He turns his critical eye to this language feature in the following article, however, which demonstrates why writing exception-safe code is more difficult than most programmers realize: ¤ MEC++ Rec Reading, P22
"Exception Handling: A False Sense of Security," °C++ Report, Volume 6, Number 9, November-December 1994, pages 21-24. ¤ MEC++ Rec Reading, P23
If you are contemplating the use of exceptions, read this article before you proceed. ¤ MEC++ Rec Reading, P24
Once you've mastered the basics of C++ and are ready to start pushing the envelope, you must familiarize yourself with ¤ MEC++ Rec Reading, P25
I generally refer to this as "the LSD book," because it's purple and it will expand your mind. Coplien covers some straightforward material, but his focus is really on showing you how to do things in C++ you're not supposed to be able to do. You want to construct objects on top of one another? He shows you how. You want to bypass strong typing? He gives you a way. You want to add data and functions to classes as your programs are running? He explains how to do it. Most of the time, you'll want to steer clear of the techniques he describes, but sometimes they provide just the solution you need for a tricky problem you're facing. Furthermore, it's illuminating just to see what kinds of things can be done with C++. This book may frighten you, it may dazzle you, but when you've read it, you'll never look at C++ the same way again. ¤ MEC++ Rec Reading, P27
If you have anything to do with the design and implementation of C++ libraries, you would be foolhardy to overlook ¤ MEC++ Rec Reading, P28
Carroll and Ellis discuss many practical aspects of library design and implementation that are simply ignored by everybody else. Good libraries are small, fast, extensible, easily upgraded, graceful during template instantiation, powerful, and robust. It is not possible to optimize for each of these attributes, so one must make trade-offs that improve some aspects of a library at the expense of others. Designing and Coding Reusable C++ examines these trade-offs and offers down-to-earth advice on how to go about making them. ¤ MEC++ Rec Reading, P30
- MoreEffectiveC++/Exception . . . . 2 matches
||[[TableOfContents]]||
== Item 12: Understand how throwing an exception differs from passing a parameter or calling a virtual function ==
double sqrtOfi = sqrt(i);
마지막으로 인자 넘기기와 예외 전달(던지기:throw)의 다른 점은 catch 구문은 항상 ''catch가 쓰여진 순서대로 (in the order of their appearance)'' 구동된다는 점이다. (영어 구문을 참조하시길) 말이 이상하다. 그냥 다음 예제를 보자
Catch-by-value는 표준 예외 객체들 상에에서 예외 객체의 삭제 문제에 관해서 고민할 필요가 없다. 하지만 예외가 전달될때 '''두번의''' 복사가 이루어 진다는게 문제다. (Item 12참고) 게다가 값으로의 전달은 ''slicing problem''이라는 문제를 발생시킨다. 이게 뭐냐 하면, 만약 표준 예외 객체에서 유도(상속)해서 만들어진 예외 객체들이 해당 객체의 부모로 던저 진다면, 부모 파트 부분만 값으로 두번째 복사시에 복사되어서 전달되어 버린다는 문제다. 즉 잘라버리는 문제 "slice off" 라는 표현이 들어 갈만 하겠지. 그들의 data member는 아마 부족함이 생겨 버릴 것이고 해당 객체상에서 가상 함수를 부를때 역시 문제가 발생해 버릴 것이다. 아마 무조건 부모 객체의 가상 함수를 부르게 될 것이다.(이 같은 문제는 함수에 객체를 값으로 넘길때도 똑같이 제기 된다.) 예를 들어서 다음을 생각해 보자
== Item 15: Understand the costs of exception handling ==
물론 저것은 이론이다. 실질적으로 예외 지원 밴더들은 당신이 예외 작성을 위한 코드의 첨가를 당신이 예외를 지원하느냐 마느냐에 따라 조정할수 있도록 만들어 놓았다.(작성자주:즉 예외 관련 처리의 on, off가 가능하다.) 만약 당신이 당신의 프로그램의 어떠한 영역과, 연계되는 모든 라이브러리에서 try, throw, catch를 빼고 예외 지원 사항을 빼고 당신 스스로 속도, 크기 같은 예외처리시 발생하는 단점을 제거할수 있을 것이다. 시감이 지나 감에 따라 라이브러리에 차용되는 예외의 처리는 점점 늘어나게 되고, 예외를 제거하는 프로그래밍은 갈수록 내구성이 약해 질것이다. 하지만, 예외처리를 배제한 컴파일을 지원하는 현재의 C++ 소프트웨어 개발상의 상태는 확실히 예외처리 보다 성능에서 우위를 점한다. 그리고 그것은 또한 예외 전달(propagate) 처리와, 예외를 생각하지 않은 라이브러리들의 사용에 무리없는 선택이 될것이다.
문제의 초점은 예외가 던지는 비용이다. 사실 예외는 희귀한 것이라 보기 때문에 그렇게 크게 감안할 내용이 아니다. 그들이 ''예외적인''(exceptional) 문제의(event) 발생을 지칭함에도 불구하고 말이다. 80-20 규칙은(Item 16에서 언급) 우리에게 그런 이벤트들은 거의 프로그램의 부과되는 성능에 커다란 영향을 미치지 않을 것이라고 말한다. 그럼에도 불구하고, 나는 당신이 이 문제에 관하여 예외를 던지고, 받는 비용에 관한 대답에서 얼마나 클까를 궁금할것이라고 생각한다. 대강 일반적인 함수의 반환에서 예외를 던진다면 대충 '''세개의 명령어 정도 더 느려지는'''(three order of magnitude) 것이라고 가정할수 있다. 하지만 당신은 그것만이 아닐것이라고 이야기 할것이다. 반대로 당신이 이런 논쟁을 데이터 구조나 루프의 순회 구조를 효율적으로 만드는데 신경을 쓴다면 더 좋은 시간을 보내는 것이라고 생각한다.
- Ones/1002 . . . . 2 matches
def isMultiplyOf(aValue, mulValue):
if isMultiplyOf(onesValue,aValue):
- OperatingSystem . . . . 2 matches
[[TableOfContents]]
In computing, an operating system (OS) is the system software responsible for the direct control and management of hardware and basic system operations. Additionally, it provides a foundation upon which to run application software such as word processing programs and web browsers.
일종의, [[SeparationOfConcerns]]라고 볼 수 있다. 사용자는 OperatingSystem (조금 더 엄밀히 이야기하자면, [[Kernel]]) 이 어떻게 memory 와 I/O를 관리하는지에 대해서 신경쓸 필요가 없다. (프로그래머라면 이야기가 조금 다를 수도 있겠지만 :) )
* [[windows|MicrosoftWindows]]
- OutlineProcessorMarkupLanguage . . . . 2 matches
[[TableOfContents]]
현재 RSS 리더에서 피드를 공유하는 목적으로 주로 이용되는 포맷으로, Radio UserLand 의 DaveWiner 가 개발했다.
- PPProject/Colume2Exercises . . . . 2 matches
|| [[TableOfContents]] ||
막힌다는 느낌이 들면, 문제를 다시 이해해본다. HowToSolveIt에서 나왔던 발제를 스스로 해본다. 이번에는 빼먹고 넘어간 조건이있는가?라는 발제를 빨리 했더라면 해결 할 수 있었을 것이다.
- PaintBox . . . . 2 matches
[[TableOfContents]]
* How To Program Java 6E
- PowerOfCryptography/허아영 . . . . 2 matches
long double도 sizeof(long double)하니까 크기가 double과 같게 나오네요.
범위지정과 [PowerOfCryptography/Hint]를보고 ver 3을 만들기로 했다..
[LittleAOI] [PowerOfCryptography]
- PragmaticVersionControlWithCVS . . . . 2 matches
= Table Of Contents =
|| ch4 || [PragmaticVersionControlWithCVS/HowTo] ||
- PragmaticVersionControlWithCVS/CommonCVSCommands . . . . 2 matches
|| [[TableOfContents]] ||
M SourceCode/HowTo.tip
- PragmaticVersionControlWithCVS/Getting Started . . . . 2 matches
|| [PragmaticVersionControlWithCVS/WhatIsVersionControl] || [PragmaticVersionControlWithCVS/HowTo] ||
|| [[TableOfContents]] ||
root@eunviho:~/tmpdir/aladdin# cvs commit -m "users like italian word of one"
root@eunviho:~/tmpdir/sesame# cvs commit -m "must be japanese of word one"
users like italian word of one
- PragmaticVersionControlWithCVS/HowTo . . . . 2 matches
|| [[TableOfContents]] ||
= How To =
- PrimaryArithmetic/sun . . . . 2 matches
numbers = String.valueOf(number).getBytes();
String occurs = (counts == 0) ? "No" : String.valueOf(counts);
- ProgrammingPearls . . . . 2 matches
[[TableOfContents]]
|| ["ProgrammingPearls/Column5"] || A Small Matter Of Programming ||
|| ["ProgrammingPearls/Column7"] || The Back of the Envelope ||
|| ["ProgrammingPearls/Column15"] || Strings of Pearls ||
- ProjectGaia/계획설계 . . . . 2 matches
|| [[TableOfContents]] ||
- 페이지ID | 첫RecordID | FreeSpace | ptrToFree -
* 불필요할 것으로 판단되는 {{{~cpp NumberOfRecord}}} 값은 오버헤드차원에서 삭제처리하였고,,
- REFACTORING . . . . 2 matches
|| [[TableOfContents]] ||
특별히 때를 둘 필요는 없다. 틈나는 대로. Don Robert 의 The Rule of Three 원칙을 적용해도 좋을 것 같다.
See Also HowToStudyRefactoring, Xper:RefactoringWorkbook
- RandomWalk/황재선 . . . . 2 matches
void printNumOfMove(int count) {
cout << "\n(1)The total number of legal moves: " << count << endl;
printNumOfMove(count);
- Refactoring/MakingMethodCallsSimpler . . . . 2 matches
[[TableOfContents]]
The name of a method does not reveal its purpose.
''Change the name of the method''
You have a method that returns a value but also changes the state of an object.
You have a method that runs different code depending on the values of an enumerated parameter.
''Create a separate method for each value of the parameter''
You have a group of parameters that naturally go together.
} catch (ArrayIndexOutOfBoundsException e) {
- STLErrorDecryptor . . . . 2 matches
{{| [[TableOfContents]] |}}
이러한 현상은 이펙티브 STL의 항목 49에서도 다루어진 이야기입니다. 원저자는 "많이 읽어서 익숙해져라"라는 결론을 내리고 있지만, 이 문제를 도구적으로 해결한 방법도 있다는 언급도 하고 있었죠. 여기서 이야기하는 [http://www.bdsoft.com/tools/stlfilt.html STL 에러 해독기](이하 해독기)가 바로 그것입니다. 이 도구는 VC 컴파일러가 출력하는 에러 메시지를 가로채어 STL에 관련된 부분을 적절하게 필터링해 줍니다.
* STL 에러 해독기 패키지 (Win32용) : STLfilt.zip이란 이름을 가지고 있습니다 (http://ww.bdsoft.com/tools/stlfilt.html)
가) Visual C++가 설치된 디렉토리로 이동하고, 여기서 \bin 디렉토리까지 찾아 들어갑니다. (제 경우에는 D:\Program Files2\Microsoft Visual Studio .NET\Vc7\bin입니다.) 제대로 갔으면, 원래의 CL을 백업용으로 모셔다 놓을 폴더를 하나 만듭니다. (제 경우에는 '''native_cl'''이란 이름으로 만들었습니다.) 그리고 나서 CL.EXE를 그 폴더에 복사해 둡니다.
****** {BD Software Proxy CL v2.26} STL Message Decryption is Off ******
****** {BD Software Proxy CL v2.26} STL Message Decryption is ON! ******
- StringOfCPlusPlus/영동 . . . . 2 matches
cout<<"==========String Of C++====================="<<endl;
["StringOfCPlusPlus"]
- StructureAndInterpretationOfComputerPrograms . . . . 2 matches
see NoSmok:StructureAndInterpretationOfComputerPrograms , Moa:StructureAndInterpretationOfComputerPrograms
- SummationOfFourPrimes/문보창 . . . . 2 matches
// no10168 - SumOfFourPrimes(a)
void showPrime(int prime1, int prime2, bool isEven);
showPrime(prime1, prime2, isEven);
void showPrime(int prime1, int prime2, bool isEven)
[SummationOfFourPrimes] [문보창]
- TAOCP . . . . 2 matches
* Title : TheArtOfComputerProgramming
* TheArtOfComputerProgramming(TAOCP) vol1. FundamentalAlgorithms을 읽는다.
- TheJavaMan/달력 . . . . 2 matches
JPanel showPanel;
showPanel = new JPanel();
showPanel.setLayout(new GridLayout(7, 7));
add(showPanel, BorderLayout.CENTER);
tfYear.setText(String.valueOf(Calendar.getInstance().get(Calendar.YEAR)));
showPanel.removeAll();
showPanel.add(new JLabel("일", SwingConstants.CENTER));
showPanel.add(new JLabel("월", SwingConstants.CENTER));
showPanel.add(new JLabel("화", SwingConstants.CENTER));
showPanel.add(new JLabel("수", SwingConstants.CENTER));
showPanel.add(new JLabel("목", SwingConstants.CENTER));
showPanel.add(new JLabel("금", SwingConstants.CENTER));
showPanel.add(new JLabel("토", SwingConstants.CENTER));
showPanel.add(new JLabel(""));
showPanel.add(new JLabel(String.valueOf(i + 1), SwingConstants.CENTER));
showPanel.add(new JLabel(""));
showPanel.updateUI();
- TowerOfCubes . . . . 2 matches
=== About [TowerOfCubes] ===
|| [조현태] || C++ || ??? || [TowerOfCubes/조현태] ||
- TowerOfCubes/조현태 . . . . 2 matches
== [TowerOfCubes/조현태] ==
void ShowBoxStack(vector<SBoxBlock>& showStack)
cout << showStack.size() << endl;
for (register int i = (int)showStack.size() - 1; i >= 0 ; --i)
cout << showStack[i].number + 1 << " ";
cout << FACE_NAME[showStack[i].topFace] << endl;
ShowBoxStack(bestStack);
[TowerOfCubes]
- TugOfWarInput . . . . 2 matches
이 자료를 TugOfWar 프로그램에 넣으면 (심사 서버에서) 10초 이내에 다음 결과가 나와야 한다.
참고로 TugOfWar 온라인 로봇 심사위원은 틀렸다. 잘못된 프로그램(50,50,100,200 경우 답이 150,250이어야 하는데, 200,200인 프로그램도 통과)을 걸러내지 못한다.
- UbuntuLinux . . . . 2 matches
[[TableOfContents]]
[https://wiki.ubuntu.com/ThinClientHowtoNAT] 이 두 문서를 따라하다 보니 어느새 다른 컴퓨터에서 인터넷에 연결할 수 있는 것이 아닌가!
방법은 서버에서 서브도메인을 나눠주는 것이 좋겠는데, 아직 이건 잘 모르겠고 Samba를 통해 공유 폴더를 이용하는 수준까지 이르렀다. [http://us4.samba.org/samba/docs/man/Samba-HOWTO-Collection/FastStart.html#anon-example 따라하기]
[http://www.dougsparling.com/comp/howto/linux_java.html]
For more information on the usage of update-rc.d
CTRL + ALT + Left/right arrow key. Switches to the new side of the cube for me.
- WebLogicSetup . . . . 2 matches
[[TableOfContents]]
http://localhost:7001/nameOfFile.jsp 의 형식을 취한다.
- WeightsAndMeasures/신재동 . . . . 2 matches
#showTurtles(pile)
def showTurtles(turtles):
numOfTurtle = pileUpTurtles(turtles)
print numOfTurtle
- WikiSandBox . . . . 2 matches
[[TableOfContents]]
* 처음 시작할 때, UserPreferences 에서의 실제 [필명], HallOfNosmokian 명부에서의 기재 [필
- WikiSlide . . . . 2 matches
* a technology for collaborative creation of internet and intranet pages
* Creating documentation and slide shows ;)
* Structure of pages
== How do I navigate? ==
* Title search and full text search at bottom of page
* SiteNavigation: A list of the different indices of the Wiki
* TitleIndex: A list of all pages in the Wiki
* WordIndex: A list of all words in page titles (i.e. a list of keywords/concepts in the Wiki)
To edit a page, just click on [[Icon(edit)]] or on the link "`EditText`" at the end of the page. A form will appear enabling you to change text and save it again. A backup copy of the previous page's content is made each time.
You can check the appearance of the page without saving it by using the preview function - ''without'' creating an entry on RecentChanges; additionally there will be an intermediate save of the page content, if you have created a homepage ([[Icon(home)]] is visible).
(!) If you discover an interesting format somewhere, just use the "raw" icon to find out how it was done.
(!) You can subscribe to pages to get a mail on every change of that page. Just click on the envelope [[Icon(subscribe)]] at top right of the page.
Headlines are placed on a line of their own and surrounded by one to five equal signs denoting the level of the headline. The headline is in between the equal signs, separated by a space. Example: [[BR]] `== Second Level ==`
Preformatted text (e.g. a copy of an email) should be placed inside three curly braces `{{{ ... }}}`: {{{
Tables appear if you separate the content of the columns by `||`. All fields of the same row must be also on the same line in the editor.
* `TableOfContents` - show a local table of contents
* `PageList` - generates lists of pages with titles matching a pattern
This brings up a page with a variety of possibilities to create the new page:
* click on one of the listed templates to base your page on the content of the selected template.
Below the list of templates you will also find a list of existing pages with a similar name. You should always check this list because someone else might have already started a page about the same subject but named it slightly differently.
- WindowsTemplateLibrary . . . . 2 matches
{{| [[TableOfContents]] |}}
{{|The Windows Template Library (WTL) is an object-oriented Win32 encapsulation C++ library by Microsoft. The WTL supports an API for use by programmers. It was developed as a light-weight alternative to Microsoft Foundation Classes. WTL extends Microsoft's ATL, another lightweight API for using COM and for creating ActiveX controls. Though created by Microsoft, it is unsupported.
In an uncharacteristic move by Microsoft—an outspoken critic of open source software—they made the source code of WTL freely available. Releasing it under the open-source Common Public License, Microsoft posted the source on SourceForge, an Internet open-source repository. The SourceForge version is 7.5.
Being an unsupported library, WTL has little formal documentation. However, most of the API is a direct mirror of the standard Win32 calls, so the interface is familiar to most Windows programmers.|}}
[http://www.microsoft.com/downloads/details.aspx?FamilyID=128e26ee-2112-4cf7-b28e-7727d9a1f288&DisplayLang=en MS WTL]
- XMLStudy_2002/Encoding . . . . 2 matches
[[TableOfContents]]
Shuart Culshaw. "Towards a Truly WorldWide Web. How XML and Unicode are making it easier to publish multilingual
- Yggdrasil . . . . 2 matches
|| [[TableOfContents]] ||
* ["StringOfCPlusPlus/영동"] [[BR]]
- ZeroPageHistory . . . . 2 matches
||1학기 ||회장 이창섭, 12기 회원 모집. ZeroWiki 시스템 도입. Devils 통합. Internet Problem Solving Contest 참여, 서강대 MentorOfArts 팀과 프로그래밍파티 개최 ||
* AOI, The Art Of Computer Programming
- ZeroPageServer/SubVersion . . . . 2 matches
[[TableOfContents]]
* Many improved APIs
- ZeroPageServer/old . . . . 2 matches
[[TableOfContents]]
* Proxy Server 세팅 - 학교 외부에서 [IeeeComputer], [IeeeSoftware] 를 보게 해준다.
* [http://www.robotstxt.org/wc/exclusion.html robot]규약 으로 엠파스의 침입을 막아야 한다. HowToBlockEmpas
- ZeroPage성년식/거의모든ZP의역사 . . . . 2 matches
||1학기 ||회장 이창섭, 12기 회원 모집. ZeroWiki 시스템 도입. Devils 통합. Internet Problem Solving Contest 참여, 서강대 MentorOfArts 팀과 프로그래밍파티 개최 ||
* AOI, The Art Of Computer Programming
- ZeroWiki/제안 . . . . 2 matches
[[TableOfContents]]
HowToEscapeFromMoniWiki
- [Lovely]boy^_^/Diary/12Rest . . . . 2 matches
[[TableOfContents]]
* I modify above sentence.--; I test GetAsyncKeyState(), but it's speed is same with DInput.--; How do I do~~~?
- [Lovely]boy^_^/Diary/2-2-11 . . . . 2 matches
[[TableOfContents]]
== ToDo List of a this week ==
* 선호랑 ["TheWarOfGenesis2R"]의 일환으로 타일 에디터를 만들었다. BMP 파일 약간 개조해서 뒤에다가 타일 데이터를 덧붙였다.
- [Lovely]boy^_^/EnglishGrammer/PresentAndPast . . . . 2 matches
[[TableOfContents]]
This means) She is driving now, at the time of speaking. The action is not finished.
B. I am doing something = I'm in the middle of doing something; I've started doing it and I haven't finished yet.
Often the action is happening at the time of speaking.
But the action is not necessarily happening at the time of speaking.
This means) Tom is not reading the book at the time of speaking.
He means that he has started it but has not finished it yet. He is in the middle of reading it.
ex) The population of the world is rising very fast.
or repeateldy or that something is true in general. It is not important whether the action is happening at the time of speaking
D. We use the simple present when we say how often we do things ( 빈도를 나타내는 문장을 만들때는 단순 현재를 쓴다. )
Note the position of always/never/usually, etc... (before the main verb, after be verb) ( 위치 주의 )
ex) I never drink coffee at night.
We use the present continuous for something that is happening at or around the time of speaking.
It means that I do things too often, or more often than normal.
I'm thinking ( = considering) of quitting my job.
We use am/is/are being to say how somebody is behaving. It is not usually possible in other sentences.
A. He ''started'' composing at the age of five and ''wrote'' more than 600 pieces of music.
B. Very often the simple past ends in -ed (꽤 자주 -ed로 끝난단 말입니다.)
But many verbs are irregular.(안 그런것도 많단 말입니다.)
D. The past of be is was/were.(be동사의 과거는 was/were랍니다.)
- [Lovely]boy^_^/ExtremeAlgorithmStudy . . . . 2 matches
[[TableOfContents]]
* ["HowToStudyDataStructureAndAlgorithms"]
- aekae/code . . . . 2 matches
void ShowTable(int table[5][5]);
ShowTable(table);
void ShowTable(int table[5][5])
NumberOfVisitedPlace++;
return (ArrSize*ArrSize==NumberOfVisitedPlace);
void show();
case 3 : show();
void show()
- html5/richtext-edit . . . . 2 matches
[[tableofcontents]]
designMode : document객체가 가진 속성의 하나, 'on' 'off'모드 가짐
* anchorOffset : anchorNode 안에서 선택을 시작한 위치의 오프셋 반환
* focusOffset : focusNode 안에서 선택을 종료한 위치의 오프셋 가져옴
* collapse(parentNode, offset) : 지정한 요소(parrentNode)안의 지정한 위치(offset)으로 커서를 이동시킨다
- 기술적인의미에서의ZeroPage . . . . 2 matches
second byte of the instruction and assumming a zero high address byte.
Careful use of the zero page can result in significant increase in code efficient.
The zero page is the memory address page at the absolute beginning of a computer's address space (the lowermost page, covered by the memory address range 0 ... page size?1).
In early computers, including the PDP-8, the zero page had a special fast addressing mode, which facilitated its use for temporary storage of data and compensated for the relative shortage of CPU registers. The PDP-8 had only one register, so zero page addressing was essential.
Possibly unimaginable by computer users after the 1980s, the RAM of a computer used to be faster than or as fast as the CPU during the 1970s. Thus it made sense to have few registers and use the main memory as substitutes. Since each memory location within the zero page of a 16-bit address bus computer may be addressed by a single byte, it was faster, in 8-bit data bus machines, to access such a location rather than a non-zero page one.
For example, the MOS Technology 6502 has only six non-general purpose registers. As a result, it used the zero page extensively. Many instructions are coded differently for zero page and non-zero page addresses:
The above two instructions both do the same thing; they load the value of $00 into the A register. However, the first instruction is only two bytes long and also faster than the second instruction. Unlike today's RISC processors, the 6502's instructions can be from one byte to three bytes long.
Zero page addressing now has mostly historical significance, since the developments in integrated circuit technology have made adding more registers to a CPU less expensive, and have made CPU operations much faster than RAM accesses. Some computer architectures still reserve the beginning of address space for other purposes, though; for instance, the Intel x86 systems reserve the first 512 words of address space for the interrupt table.
- 논문번역/2012년스터디/이민석 . . . . 2 matches
* 「Experiments in Unconstrained Offline Handwritten Text Recognition」 번역
== Experiments in Unconstrained Offline Handwritten Text Recognition(제약 없는 오프라인 필기 글자 인식에 관한 실험) ==
전처리에서 벌충할 수 없는 서로 다른 글씨체 사이의 변동을 고려하기 위해 우리는 [13]에 서술된 접근법과 비슷한, 다저자/저자 독립식 인식을 위한 글자 이서체 모형을 적용한다. 이서체는 글자 하위 분류, 즉 특정 글자의 서로 다른 실현이다. 이는 베이스라인 시스템과달리HMM이이제서로다른글자 하위 분류를 모델링하는 데 쓰임을 뜻한다. 글자별 하위 분류 개수와 이서체 HMM 개수는 휴리스틱으로 결정하는데, 가령 다저자식에 적용된 시스템에서 우리는 이서체 개수가 저자 수만큼 있다고 가정한다. 초기화에서 훈련 자료는 이서체 HMM들을 임의로 선택하여 이름표를 붙인다. 훈련 도중 모든 글자 표본에 대해 해당하는 모든 이서체에 매개변수 재추정을 병렬 적용한다. 정합 가능성은 특정 모형의 매개변수가 현재 표본에 얼마나 강하게 영향받는 지를 결정한다. 이서체 이름표가 유일하게 결정되지는 않기에 이 절차는 soft vector quantization과 비슷하다.
위 식에서 P(W)는 글자 시퀀스 w의 언어 모형 확률이고 P(X|W)는 이 글자 시퀀스를 그 글자 모형에 따라 입력 데이터 x로서 관찰한 확률이다. 우리의 경우 absolute discounting과 backing-off for smoothing of probability distribution을 이용한 바이그램 언어 모형을 적용하였다. (cf. e.g. [3])
추가로 Bern 대학의 Institute of Informatics and Applied Mathematics, 즉 Horst Bunke와 Urs-Viktor Marti에게 감사한다. 이들은 우리가 필기 양식 데이터베이스인 IAM[10]을 인식 실험에 쓰는 것을 허락하였다.
- 덜덜덜/숙제제출페이지 . . . . 2 matches
[[TableOfContents]]
위에 이름까지 같이 함께 묶어서 넣고 싶으면 .. 이름은 타입이 다르기때문에 구조체라는것을 써서 같이 묶어서 넣을수 있습니다. 구조체는 나중에 배울겁니다. ^^ 그리고 주석을 사용안하고 변수명으로 의미를 알수 있게 해줄수 있다면 그게 더 좋습니다. 변수명이 조금 길어지더라도 주석 없어도 이해가도록 짜면 좋습니다.(리펙토링에 나오는 얘기..) 예를 들면 국어 성적 변수명은 KoreaScore 혹은 ScoreOfKorea 이런식으로 쓸수 있습니다. - [상협]
- 데블스캠프2002 . . . . 2 matches
|| 6월 24일 || 월요일 || (이정직),(남상협) || DOS, ["FoundationOfUNIX"] ||
1. ["StringOfCPlusPlus"] - 1학년 여름 방학때 제로페이지에서 했던 문자열 다루기 ["상협"]
- 데블스캠프2002/진행상황 . . . . 2 matches
* ["FoundationOfUNIX"] - Unix
* 진행의 순서 모호 - 선호도 인정했지만 체계적인 준비가 좀 부족했던점. 본래 준비하기로 한 내용과 달랐다는 점(화일 입출력 부분) 그리고 Table Of Contents 의 부재. 그리고 사람들의 질문을 받아서 이야기 하는 방법의 약점이라고 할까. 잘못하면 전체 내용의 연결고리를 잇지 못한다는 점이 있었다고 생각
- 데블스캠프2005/java . . . . 2 matches
'''Early history of JavaLanguage (quoted from [http://en.wikipedia.org/wiki/Java_programming_language#Early_history wikipedia] ):
The Java platform and language began as an internal project at Sun Microsystems in the December 1990 timeframe. Patrick Naughton, an engineer at Sun, had become increasingly frustrated with the state of Sun's C++ and C APIs and tools. While considering moving to NeXT, Patrick was offered a chance to work on new technology and thus the Stealth Project was started.
The Stealth Project was soon renamed to the Green Project with James Gosling and Mike Sheridan joining Patrick Naughton. They, together with some other engineers, began work in a small office on Sand Hill Road in Menlo Park, California to develop a new technology. The team originally considered C++ as the language to use, but many of them as well as Bill Joy found C++ and the available APIs problematic for several reasons.
Their platform was an embedded platform and had limited resources. Many members found that C++ was too complicated and developers often misused it. They found C++'s lack of garbage collection to also be a problem. Security, distributed programming, and threading support was also required. Finally, they wanted a platform that could be easily ported to all types of devices.
According to the available accounts, Bill Joy had ideas of a new language combining the best of Mesa and C. He proposed, in a paper called Further, to Sun that its engineers should produce an object-oriented environment based on C++. James Gosling's frustrations with C++ began while working on Imagination, an SGML editor. Initially, James attempted to modify and extend C++, which he referred to as C++ ++ -- (which is a play on the name of C++ meaning 'C++ plus some good things, and minus some bad things'), but soon abandoned that in favor of creating an entirely new language, called Oak named after the oak tree that stood just outside his office.
Like many stealth projects working on new technology, the team worked long hours and by the summer of 1992, they were able to demo portions of the new platform including the Green OS, Oak the language, the libraries, and the hardware. Their first attempt focused on building a PDA-like device having a highly graphical interface and a smart agent called Duke to assist the user.
In November of that year, the Green Project was spun off to become a wholly owned subsidiary of Sun Microsystems: FirstPerson, Inc. The team relocated to Palo Alto. The FirstPerson team was interested in building highly interactive devices and when Time Warner issued an RFP for a set-top box, FirstPerson changed their target and responded with a proposal for a set-top box platform. However, the cable industry felt that their platform gave too much control to the user and FirstPerson lost their bid to SGI. An additional deal with The 3DO Company for a set-top box also failed to materialize. FirstPerson was unable to generate any interest within the cable TV industry for their platform. Following their failures, the company, FirstPerson, was rolled back into Sun.
- 데블스캠프2012/다섯째날/후기 . . . . 2 matches
[[TableOfContents]]
* [이재형] - 오버로딩이나, 탬플릿 까지는 어렵지 않게 이해했는데 그 뒤부터 클래스, 구조체, 생성자와 소멸자, 상속, 가상함수 등등 부족한게 많아서 정말 멘붕에 멘붕을 거듭했습니다. 그래도 정말정말 How에대한 관점으로 공부해야겠다는 필요성과 더불어 이번 방학 공부에 동기부여가 잘 될 것 같아서 좌절감만 드는 것이 아니였습니다. 좋은 어려움이였던 것 같습니다.
- 데블스캠프2012/셋째날/앵그리버드만들기 . . . . 2 matches
return {x:e.clientX + pageXOffset - e.target.offsetLeft, y:e.clientY + pageYOffset - e.target.offsetTop};
- 몸짱프로젝트/Maze . . . . 2 matches
}Offset;
Offset move[8]= {
- 송지원 . . . . 2 matches
[[TableOfContents]]
* [데블스캠프2011/다섯째날/How To Write Code Well/송지원, 성화수]
- 알고리즘2주숙제 . . . . 2 matches
1. (Warm up) An eccentric collector of 2 x n domino tilings pays $4 for each vertical domino and $1 for each horizontal domino. How many tiling are worth exactly $m by this criterion? For example, when m = 6 there are three solutions.
4. (Homework exercises) How many spanning trees are in an n-wheel( a graph with n "outer" verices in a cycle, each connected to an (n+1)st "hub" vertex), when n >= 3?
6. Let a<sub>r</sub> be the number of ways to select r balls from 3 red balls, 2 green balls, and 5 white balls.
7. Let a<sub>r</sub> be the number of ways r cents worth of postage can be placed on a letter using only 5c, 12c, and 25c stamps. The positions of the stamps on the letter do not matter.
8. Let a<sub>r</sub> be the number of ways to pay for an item costing r cents with pennies, nickels, and dimes.
- 영호의해킹공부페이지 . . . . 2 matches
Principles of Buffer Overflow explained by Jus
manner of exploiting daemons - The Buffer Overflow.
coded daemons - by overflowing the stack one can cause the software to execute
many are, a root shell will be spawned, giving full remote access.
A buffer is a block of computer memory that holds many instances of the same
A stack has the property of a queue of objects being placed one on top of the
to the stack (PUSH) and removed (POP). A stack is made up of stack frames,
The stack pointer (SP) always points to the top of the stack, the bottom of it
is static. PUSH and POP operations manipulate the size of the stack
stack by giving their offsets from SP, but as POP's and PUSH's occur these
offsets change around. Another type of pointer points to a fixed location
it can handle. We use this to change the flow of execution of a program -
hopefully by executing code of our choice, normally just to spawn a shell.
We can change the return address of a function by overwriting the entire
contents of the buffer, by overfilling it and pushing data out - this then
means that we can change the flow of the program. By filling the buffer up
This is just a simplified version of what actually happens during a buffer
me +-20 mins to do the whole thing, but at least I was keeping a log of me
save, of course, for the explanations. Next time I'll get human and actually
values of the registers when it dies....
- 오목/진훈,원명 . . . . 2 matches
[[TableOfContents]]
// OmokView.h : interface of the COmokView class
// Microsoft Visual C++ will insert additional declarations immediately before the previous line.
// OmokView.cpp : implementation of the COmokView class
ASSERT(m_pDocument->IsKindOf(RUNTIME_CLASS(COmokDoc)));
- 유혹하는글쓰기 . . . . 2 matches
[[TableOfContents]]
''지옥으로 가는 길은 수많은 부사들로 뒤덮여 있다..잔디밭에 한 포기가 돋아나면 제법 예쁘고 독특해 보인다. 그러나 이때 곧바로 뽑아버리지 않으면...철저하게(totally), 완벽하게(completely), 어지럽게(profligately) 민들레로 뒤덮이고 만다.''
작가에게 고마운 점이 하나 더 있다. 책을 읽는 동안 [TheElementOfStyle]을 읽고 싶은 충동을 참을 수 없었다. 드디어 때가 온 것이다!
- 임인택/내손을거친책들 . . . . 2 matches
* The Haskell School of Expression
* TheElementsOfStyle + TheElementsOfProgrammingStyle
- 정모/2012.1.20 . . . . 2 matches
* [김태진] 학우의 '''How to live SMART?''' How to use Camera?
- 정모/2013.3.18 . . . . 2 matches
[[TableOfContents]]
* (의견)가입서를 쓰는 것 자체가 소속감을 불러 일으키므로 있었으면 좋겠다. (Off-line 용)
- 제12회 한국자바개발자 컨퍼런스 후기 . . . . 2 matches
|| 15:00 ~ 15:50 || 스타트업을위한 Rapid Development (양수열) || 하둡 기반의 규모 확장성있는 트래픽 분석도구 (이연희) || 초보자를 위한 분산 캐시 활용 전략 (강대명) || Venture Capital & Start-up Investment (이종훈-벤처캐피탈협회) || How to deal with eXtream Applications? (최홍식) || SW 융합의 메카 인천에서 놀자! || 섹시한 개발자 되기 2.0 beta (자바카페 커뮤니티) ||
그 다음으로 Track 5에서 있었던 Java와 Eclipse로 개발하는 클라우드, Windows Azure를 들었다. Microsoft사의 직원이 진행하였는데 표준에 맞추려고 노력한다는 말이 생각난다. 그리고 처음엔 Java를 마소에서 어떻게 활용을 한다는 건지 궁금해서 들은 것도 있다. 이 Windows Azure는 클라우드에서 애플리케이션을 운영하든, 클라우드에서 제공한 서비스를 이용하든지 간에, 애플리케이션을 위한 플랫폼이 필요한데, 애플리케이션 개발자들에게 제공되는 서비스를 위한 클라우드 기술의 집합이라고 한다. 그래서 Large로 갈 수록 램이 15GB인가 그렇고.. 뭐 여하튼.. 이클립스를 이용해 어떻게 사용하는지 간단하게 보여주고 하는 시간이었다.
세 번째로 들은 것이 Track 5의 How to deal with eXtream Application이었는데.. 뭔가 하고 들었는데 들으면서 왠지 컴구 시간에 배운 것이 연상이 되었던 시간이었다. 다만 컴구 시간에 배운 것은 컴퓨터 내부에서 CPU에서 필요한 데이터를 빠르게 가져오는 것이었다면 이것은 서버에서 데이터를 어떻게 저장하고 어떻게 가져오는 것이 안전하고 빠른가에 대하여 이야기 하는 시간이었다.
마지막으로 Track 4에서 한 반복적인 작업이 싫은 안드로이드 개발자에게라는 것을 들었는데, 안드로이드 프로그래밍이라는 책의 저자인 사람이 안드로이드 개발에 관한 팁이라고 생각하면 될 만한 이야기를 빠르게 진행하였다. UI 매핑이라던지 파라미터 처리라던지 이러한 부분을 RoboGuice나 AndroidAnnotations를 이용해 해결할 수 있는 것을 설명과 동영상으로 잘 설명했다. 준비를 엄청나게 한 모습이 보였다. 이 부분에 대해서는 이 분 블로그인 [http://blog.softwaregeeks.org/ 클릭!] <-여기서 확인해 보시길...
- 책거꾸로읽기 . . . . 2 matches
[[TableOfContents]]
얼마 전부터 글로벌 기업들은 과거 자기네 땅에서 자기나라 사람들을 고용해 처리하던 고객관리며 회계, 물류 같은 이른바 백 오피스(Back Office)업무를 인도에 넘겨주고 있다. 주된 이유는 비용을 절감하기 위해서다. BPO(Business Process Outsourcing)산업이 번성하면서 인도는 '''세계의 사무실'''이라는 별명까기 얻게 됐다. 인도에서 BPO산업이 숙성한 이유는 여러가지다. 먼저 영어가 되는 직원들을 쉽게 구할 수 있고, IT산업이 발달해 멀리 떨어진 본국 기업과도 불편 없이 일할 수 있다는 장점이 있다. 재밌는 건 여기에 절묘한 '''황금분할'''이론도 숨어 있다는 사실이다. 미국동부와 인도는 딱 12시간의 시차가 있다. 미국인들은 잠을 잘 때 인도인들은 일을 할 수 있다는 예기이다. 적은 비용을 들여서 쉬지 않는 24시간 업무 체제를 가동시키는 셈이다. 하지만 요즘 미국인들의 '''인도인들이 일자리를 빼았는다'''는 불만으로 정치적 문제로 비화되기까지 이르었다.
- 컴퓨터고전스터디 . . . . 2 matches
* 2002년 MentorOfArts 위키에서 MythicalManMonth 로 Moa:컴퓨터고전스터디 그룹이 ZeroPagers 와 진행
* 2004년 여름방학 현재 TheArtOfComputerProgramming으로 진행
- 학회간교류 . . . . 2 matches
||[[TableOfContents]]||
어떤 방식으로 해야 재밌으면서 서로에게 유익할 수 있을까? '같이 해서 좋을 거리들' 에 대해서.~ ZP 의 행사중 자주 하는 PairProgramming 이나, 혹은 이전의 서강대 MentorOfArts 에서의 프로그래밍 파티 처럼.
- 02_Archi . . . . 1 match
[[TableOfContents]]
- 02_C++세미나 . . . . 1 match
[[TableOfContents]]
- 02_C++세미나/0515 . . . . 1 match
[[TableOfContents]]
- 02_C++세미나/0523 . . . . 1 match
[[TableOfContents]]
- 02_Python . . . . 1 match
[[TableOfContents]]
= Date of Seminar =
- 05학번만의C++Study . . . . 1 match
[[TableOfContents]]----
- 1002/TPOCP . . . . 1 match
Seminar:ThePsychologyOfComputerProgramming 맡은 챕터 정리궁리중.
Professional versus amateur programming
Professional
Stages of programming work
- 1thPCinCAUCSE . . . . 1 match
[[TableOfContents]]
- 2005Fall수업 . . . . 1 match
[[TableOfContents]]
- 2005MFC스터디 . . . . 1 match
[[TableOfContents]]
- 2005MFC이동현님의명강의 . . . . 1 match
[[TableOfContents]]
- 2005리눅스프로젝트 . . . . 1 match
[[TableOfContents]]
- 2005리눅스프로젝트<설치> . . . . 1 match
[[TableOfContents]]
- 2006신입생 . . . . 1 match
[[TableOfContents]]
- 2008리눅스스터디 . . . . 1 match
[[TableOfContents]]
- 2010Python . . . . 1 match
* 교재 : How to think like a computer scientist
- 2011년독서모임 . . . . 1 match
[[TableOfContents]]
- 2011년돌아보기 . . . . 1 match
[[TableOfContents]]
- 2012/2학기/컴퓨터구조 . . . . 1 match
[[TableOfContents]]
* Application software
* System software
- 2012년독서모임 . . . . 1 match
[[TableOfContents]]
- 2dInDirect3d/Chapter1 . . . . 1 match
[[TableOfContents]]
== Purpose of the IDirect3D8 Object ==
- 2ndPCinCAUCSE . . . . 1 match
[[TableOfContents]]
- 2thPCinCAUCSE . . . . 1 match
[[TableOfContents]]
- 2학기파이선스터디 . . . . 1 match
[[TableOfContents]]
- 2학기파이선스터디/ 튜플, 사전 . . . . 1 match
[[TableOfContents]]
>>> dic['dictionary'] = '1. A reference book containing an alphabetical list of words, ...'
>>> dic['python'] = 'Any of various nonvenomous snakes of the family Pythonidae, ...'
'1. A reference book containing an alphabetical list of words, ...'
- 2학기파이선스터디/함수 . . . . 1 match
[[TableOfContents]]
- 3DAlca . . . . 1 match
[[TableOfContents]]
- 3DGraphicsFoundation . . . . 1 match
[[TableOfContents]]
- 3DGraphicsFoundation/SolarSystem . . . . 1 match
[[TableOfContents]]
- 3DGraphicsFoundationSummary . . . . 1 match
[[TableOfContents]]
Example of using the texturemapping
- 3DStudy_2002 . . . . 1 match
[[TableOfContents]]
- 3N+1Problem/황재선 . . . . 1 match
|| [[TableOfContents]] ||
- 3rdPCinCAUCSE . . . . 1 match
[[TableOfContents]]
- ACM_ICPC/2011년스터디 . . . . 1 match
[[TableOfContents]]
* 생각치도 못한 표준입출력 때문에 고생했습니다. 저놈의 judge 프로그램을 이해하지 못하겠습니다. 입출력방식이 낯서네요. 입력 종료를 위해 값을 따로 주지 않고 알아서 EOF 까지 받아야한다니... 정올 현역때는 이런 문제 구경하기 힘들었는데ㅜㅜ 제가 뭘 크게 오해하고 있나요. 덕분에 c도 아니고 c++도 아닌 코드가 나왔습니다. 그리고 3N+1 문제가 25일 프로그래밍 경진대회에 1번 문제로 나왔습니다. 허허.. - [정진경]
* 그래서 [정진경]군이 157번[http://koistudy.net/?mid=prob_page&NO=157 The tower of Hanoi]문제를 풀고, 설명한 후 [Mario]문제(선형적인 문제)를 풀게하여 연습을 한 후 다시 파닭문제에 도전하게 되었습니다.
- ACM_ICPC/2012년스터디 . . . . 1 match
[[TableOfContents]]
* Doublets - [http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=31&page=show_problem&problem=1091]
* Where's Waldorf - [http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=31&page=show_problem&problem=951]
* Doublets - [http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=31&page=show_problem&problem=1091] //화요일까지 풀지 못하면 소스 분석이라도 해서..
* A Multiplication Game - [http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=33&page=show_problem&problem=788]
* Shoemaker's Problem - [http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=32&page=show_problem&problem=967]
- Hopcroft-Karp의 방법
- ACM_ICPC/2013년스터디 . . . . 1 match
[[TableOfContents]]
* 풀어보기 : land
* 풀어보기 : land
* [http://stackoverflow.com/questions/2631726/how-to-determine-the-longest-increasing-subsequence-using-dynamic-programming Time Complexity O(n log n) 의 Up Sequence]
* 곽병학 : Hoffman code - 쓸데없을거 같음..
* proof - [http://prezi.com/fsaynn-iexse/kadanes-algorithm/]
* 위상정렬, critical path에 대해 공부 및 코딩 - 코드 및 해설은 Fundamental of DataStructure를 참고하자.
- ACM_ICPC/PrepareAsiaRegionalContest . . . . 1 match
[[TableOfContents]]
==== Solution of Problem C. Mine Sweeper ====
==== Solution of Problem F. Coin Game ====
[http://acm.kaist.ac.kr/Problems/2004of.pdf Original Problem Text]
==== Solution of Problem G. Safe ====
- ALittleAiSeminar . . . . 1 match
||[[TableOfContent]]||
- AOI . . . . 1 match
|| [StacksOfFlapjacks] ||O ||. ||. ||. ||. ||O ||. ||. ||
- ASXMetafile . . . . 1 match
* <Abstract>: Provides a brief description of the media file.
* <Title>: Title of the media file.
* <MoreInfo href = "path of the source" / >: Adds hyperlinks to the Windows Media Player interface in order to provide additional resources on the content.
* <Entry>: Serves a playlist of media by inserting multiple "Entry" elements in succession.
* <Duration value = "00:00:00">: Sets the value attribute for the length of time a streaming media file is to be played.
* <Logo href = "path of the logo source" Style = "a style" / >: Adds custom graphics to the Windows Media player by choosing either a watermark or icon style. The image formats that Windows Media Player supports are GIF, BMP, and JPEG.
o MARK: The logo appears in the lower right corner of the video area while Windows Media Player is connecting to a server and opening a piece of content.
o ICON: The logo appears as an icon on the display panel, next to the title of the show or clip.
* <Banner href = "path of the banner source">: Places a banner (82 pixels × 30 pixels) image at the bottom of the video display area.
* <Ref href = "path of the source" / >: Specifies a URL for a content stream.
* How to define the path of source:
* ?sami="path of the source": Defines the path of a SAMI caption file within the <ref href> tag for media source.
<Abstract>: This text will show up as a Tooltip and in the Properties dialog box
<Title> Global title of the show </Title>
<Author> The name of the author </Author>
<MoreInfo href="http://www.microsoft.com/windows/windowmedia" />
<Ref href="MMS://netshow.microsoft.com/ms/sbnasfs/wtoc.asf" />
<MoreInfo href="http://www.microsoft.com/windows/windowsmedia" />
<Copyright> 2000 Microsoft Corporation </Copyright>
<MoreInfo href="http://www.microsoft.com/windows/windowsmedia" />
- AcceleratedC++ . . . . 1 match
|| ["AcceleratedC++/Chapter3"] || Working with batches of data || 2주차 ||
|| [http://www.acceleratedcpp.com/ Accelerated C++ Official Site] || 각 커파일러의 버전에 맞는 소스코드를 구할 수 있습니다. ||
|| [http://msdn.microsoft.com/visualc/vctoolkit2003/ VSC++ Toolkit] || .net 을 구입할 수 없는 상태에서 STL을 컴파일 해야할 때 사용하면 되는 컴파일러. ||
|| [http://lab.msdn.microsoft.com/express/visualc/default.aspx VS2005C++Express] || .net 2005의 VSC++버전의 Express Edition ||
- AcceleratedC++/Chapter10 . . . . 1 match
||[[TableOfContents]]||
// change the value of `x' through `p'
== 10.3 Initializing arrays of character pointers ==
// compute the number of grades given the size of the array
// and the size of a single element
static const size_t ngrades = sizeof(numbers)/sizeof(*numbers);
'''array_pointer / sizeof(*array_pointer)''' 를 이용하면 array가 가지고 있는 요소의 갯수를 알 수 있다. 자주쓰는 표현이므로 잘 익힌다.
파일의 입출력을 위해서 iostream을 파일 입출력에 맞도록 상속시킨 ofstream, ifstream객체들을 이용한다. 이들 클래스는 '''<fstream>'''에 정의 되어있다.
using std::ofstream;
ofstream outfile("out");
== 10.6 Three kinds of memory management ==
- AcceleratedC++/Chapter11 . . . . 1 match
||[[TableOfContents]]||
=== 11.3.6 세 법칙(rule of three) ===
'''Rule of three''' : 복사 생성자, 소멸자, 대입 연산자가 밀접한 관계를 갖는 것을 일컬어 표현하는 말이다.
- AcceleratedC++/Chapter12 . . . . 1 match
||[[TableOfContents]]||
if(is) { // EOF를 만나면 입력 스트림을 false 값을 리턴한다.
- AcceleratedC++/Chapter13 . . . . 1 match
||[[TableOfContents]]||
// pass the version of `compare' that works on pointers
- AcceleratedC++/Chapter14 . . . . 1 match
||[[TableOfContents]]||
// allocate new object of the appropriate type
// the rest of the class looks like `Ref_handle' except for its name
else throw run_time_error("regrade of unknown student");
- AcceleratedC++/Chapter15 . . . . 1 match
||[[TableOfContents]]||
- AcceleratedC++/Chapter16 . . . . 1 match
||[[TableOfContents]]||
- AcceleratedC++/Chapter3 . . . . 1 match
||[[TableOfContents]]||
= Chapter 3 Working with batches of data =
"follewd by end-of-file: ";
// the number and sum of grades read so far
// sum is the sum of the first count grades
=== 3.1.1 Testing for end of input ===
== 3.2 Using medians instead of averages ==
=== 3.2.1. Storing a collection of data in a vector ===
"follewd by end-of-file: ";
- AcceleratedC++/Chapter4 . . . . 1 match
||[[TableOfContents]]||
throw domain_error("median of an empty vector.");
=== 4.1.4 Three kinds of function parameters ===
"follewd by end-of-file: ";
throw domain_error("median of an empty vector");
=== 4.2.1 Keeping all of a student's data together ===
- AcceleratedC++/Chapter5 . . . . 1 match
||[[TableOfContents]]||
=== 5.2.4 The meaning of students.erase(students.begin() + i) ===
== 5.3 Using iterators instead of indices ==
- AcceleratedC++/Chapter6 . . . . 1 match
||[[TableOfContents]]||
// get the rest of the \s-1URL\s0
// make sure the separator isn't at the beginning or end of the line
// `beg' marks the beginning of the protocol-name
// the separator we found wasn't part of a \s-1URL\s0; advance `i' past this separator
// verify that the analyses will show us something
// verify that the analyses will show us something
write_analysis(cout, "median of homework turned in",
=== 6.2.4 Median of the completed homework ===
- AcceleratedC++/Chapter7 . . . . 1 match
||[[TableOfContents]]||
// read the input, keeping track of each word and how often we see it
// write the rest of the line numbers, if any
// write the rest of the words, each preceded by a space
throw domain_error("Argument to nrand is out of range");
// fetch the set of possible rules
// write the rest of the words, each preceded by a space
throw domain_error("Argument to nrand is out of range");
- AcceleratedC++/Chapter8 . . . . 1 match
|| [[TableOfContents]] ||
throw domain_error("median of an empty vector");
* 두번째 인자로 하나가 지난 값을 갖도록함으로써 자연스럽게 out-of-range의 상황을 파악하는 것이 가능하다.
//istream_iterator<int> 는 end-of-file, 에러상태를 가리킨다.
// find end of next word
- AcceleratedC++/Chapter9 . . . . 1 match
||[[TableOfContents]]||
// as defined in 9.2.1/157, and changed to read into `n' instead of `name'
// get rid of previous contents
- ActiveXDataObjects . . . . 1 match
{{| [[TableOfContents]] |}}
{{|Microsoft ADO (ActiveX Data Objects) is a Component object model object for accessing data sources. It provides a layer between programming languages and databases, which allows a developer to write programs which access data, without knowing how the database is implemented. No knowledge of SQL is required to access a database when using ADO, although one can use ADO to execute arbitrary SQL commands. The disadvantage of this is that this introduces a dependency upon the database.
[http://msdn.microsoft.com/library/default.asp?url=/library/en-us/ado270/htm/dasdkadooverview.asp MS ADO]
{{|In the newer programming framework of .NET, Microsoft also present an upgraded version of ADO called ADO.NET, its object structure is quite different from that of traditional ADO. But ADO.NET is still not quite popular and mature till now.
- AirSpeedTemplateLibrary . . . . 1 match
A number of excellent templating mechanisms already exist for Python, including Cheetah, which has a syntax similar to Airspeed.
However, in making Airspeed's syntax identical to that of Velocity, our goal is to allow Python programmers to prototype, replace or extend Java code that relies on Velocity.
- Ajax . . . . 1 match
{{|[[TableOfContents]]|}}
Ajax or Asynchronous JavaScript and XML is a term describing a web development technique for creating interactive web applications using a combination of:
Like DHTML, LAMP, or SPA, Ajax is not a technology in itself, but a term that refers to the use of a group of technologies together. In fact, derivative/composite technologies based substantially upon Ajax, such as AFLAX are already appearing.
Ajax applications use web browsers that support the above technologies as a platform to run on. Browsers that support these technologies include Mozilla Firefox, Microsoft Internet Explorer, Opera, Konqueror and Apple Safari.
- Android/PowerPointContoler . . . . 1 match
[[TableOfContents]]
- Ant . . . . 1 match
[[TableOfContents]]
* [http://developer.java.sun.com/developer/Quizzes/misc/ant.html Test your knowledge of Ant]
- Apache . . . . 1 match
[[TableOfContents]]
* [http://www.wallpaperama.com/forums/how-to-fix-could-not-determine-the-servers-fully-qualified-domain-name-t23.html 위문제상황해결링크]
- ApplicationProgrammingInterface . . . . 1 match
{{|[[TableOfContents]]|}}
{{|An application programming interface (API) is a set of definitions of the ways one piece of computer software communicates with another. It is a method of achieving abstraction, usually (but not necessarily) between lower-level and higher-level software.|}}
- ArsDigitaUniversity . . . . 1 match
학부생 수준의 전산 전공을 일년만에 마칠 수 있을까. 그런 대학이 있다(비록 지금은 펀드 문제로 중단했지만). 인터넷계의 스타 필립 그리스펀과 그의 동료 MIT 교수들이 만든 학교 ArsDigitaUniversity다. (고로, Scheme과 함께 NoSmok:StructureAndInterpretationOfComputerPrograms 를 가르친다)
- AstroAngel . . . . 1 match
[[TableOfContents]]
= Profile =
- Atom . . . . 1 match
{{| [[TableOfContents]] |}}
Atom is an XML-based document format and HTTP-based protocol designed for the syndication of Web content such as weblogs and news headlines to Web sites as well as directly to user agents. It is based on experience gained in using the various versions of RSS. Atom was briefly known as "Pie" and then "Echo".
Before the Atom work entered the IETF process, the group produced "Atom 0.3", which has support from a fairly wide variety of syndication tools both on the publishing and consuming side. In particular, it is generated by several Google-related services, namely Blogger and Gmail.
As well as syndication format, the Atom Project is producing the "Atom Publishing Protocol", with a similar aim of improving upon and standarizing existing publishing mechanisms, such as the Blogger API and LiveJournal XML-RPC Client/Server Protocol.
- BasicJAVA2005 . . . . 1 match
[[TableOfContents]]
- BasicJava2005/5주차 . . . . 1 match
} catch(ArrayIndexOutOfBoundsException e) {
- Basic알고리즘 . . . . 1 match
{{| " 그래서 우리는 컴퓨터 프로그래밍을 하나의 예술로 생각한다. 그것은 그 안에 세상에 대한 지식이 축적되어 있기 때문이고, 기술(skill) 과 독창성(ingenuity)을 요구하기 때문이고 그리고 아름다움의 대상(objects of beauty)을 창조하기 때문이다. 어렴풋하게나마 자신을 예술가(artist)라고 의식하는 프로그래머는 스스로 하는 일을 진정으로 즐길 것이며, 또한 남보다 더 훌륭한 작품을 내놓을 것이다. |}} - The Art Of Computer Programming(Addison- wesley,1997)
- Beginning_XML . . . . 1 match
[[TableOfContents]]
- Bigtable/DataModel . . . . 1 match
[[TableOfContents]]
- Bigtable기능명세 . . . . 1 match
[[TableOfContents]]
- Bioinformatics . . . . 1 match
[[TableOfContents]]
* 교재 : “Bioinformatics: A practical guide to the analysis of genes and proteins”, Second Edition edited by Baxevanis & Ouellette
National Center for Biotechnology Information 분자 생물 정보를 다루는 국가적인 자료원으로서 설립되었으며, NCBI는 공용 DB를 만들며, 계산에 관한 생물학에 연구를 이끌고 있으며, Genome 자료를 분석하기 위한 software 도구를 개발하고, 생물학 정보를 보급하고 있습니다. - 즉, 인간의 건강과 질병에 영향을 미치는 미세한 과정들을 보다 더 잘 이해하기 위한 모든 활동을 수행
Established in 1988 as a national resource for molecular biology information, NCBI creates public databases, conducts research in computational biology, develops software tools for analyzing genome data, and disseminates biomedical information - all for the better understanding of molecular processes affecting human health and disease.
- BlueZ . . . . 1 match
[[TableOfContents]]
The overall goal of this project is to make an implementation of the Bluetooth™ wireless standards specifications for Linux. The code is licensed under the GNU General Public License (GPL) and is now included in the Linux 2.4 and Linux 2.6 kernel series.
ii = (inquiry_info*)malloc(max_rsp * sizeof(inquiry_info));
memset(name, 0, sizeof(name));
if (hci_read_remote_name(sock, &(ii+i)->bdaddr, sizeof(name),
int opt = sizeof(rem_addr);
// bind socket to port 1 of the first available
bind(s, (struct sockaddr *)&loc_addr, sizeof(loc_addr));
memset(buf, 0, sizeof(buf));
bytes_read = read(client, buf, sizeof(buf));
status = connect(s, (struct sockaddr *)&addr, sizeof(addr));
int opt = sizeof(rem_addr);
// bind socket to port 0x1001 of the first available
bind(s, (struct sockaddr *)&loc_addr, sizeof(loc_addr));
memset(buf, 0, sizeof(buf));
bytes_read = read(client, buf, sizeof(buf));
status = connect(s, (struct sockaddr *)&addr, sizeof(addr));
- BuildingParser . . . . 1 match
[[TableOfContents]]
- BusSimulation . . . . 1 match
Discrete Event Simulation이 되겠군요. 사람이 몇 명이 기다리느냐, 길 막힘 상태 등은 이산 확률 분포를 사용하면 될 것입니다. NoSmok:TheArtOfComputerProgramming 에서 NoSmok:DonaldKnuth 가 자기 학교 수학과 건물 엘레베이터를 몇 시간 관찰해서 데이타를 수집한 것과 비슷하게 학생들이 직접 84번, 85-1번 등의 버스를 타고 다니면서 자료 수집을 해서 그걸 시뮬레이션 실험하면 아주 많은 공부가 될 것입니다 -- 특히, 어떻게 실세계를 컴퓨터로 옮기느냐 등의 모델링 문제에 관해. 실제로 NoSmok:DonaldKnuth 는 TAOCP에서 이런 연습문제를 만들어 놨습니다. 제가 학부생 때 누군가 이런 숙제를 내줬다면 아마 한 두 계단(see also ["축적과변화"]) 올라설 계기가 되지 않았을까 하고 아쉬울 때가 있습니다. 이 문제에 드는 시간은 하루나 이틀 정도가 되겠지만 여기서 얻은 경험과 지혜는 십 년도 넘게 자신의 프로그래밍 인생에 도움이 될 것이라 믿어 의심치 않습니다. (팀으로 문제 해결을 하면 더 많은 공부가 되겠지요) see also ProgrammingPartyAfterwords 참고자료 --JuNe
- BusSimulation/영창 . . . . 1 match
[[TableOfContents]]
- C 스터디_2005여름/학점계산프로그램/김태훈김상섭 . . . . 1 match
[[TableOfContents]]
- C++ . . . . 1 match
{{|[[TableOfContents]]|}}
C++ (pronounced "see plus plus") is a general-purpose computer programming language. It is a statically typed free-form multi-paradigm language supporting procedural programming, data abstraction, object-oriented programming, and generic programming. During the 1990s, C++ became one of the most popular commercial programming languages.
Bell Labs' Bjarne Stroustrup developed C++ (originally named "C with Classes") during the 1980s as an enhancement to the C programming language. Enhancements started with the addition of classes, followed by, among many features, virtual functions, operator overloading, multiple inheritance, templates, and exception handling. The C++ programming language standard was ratified in 1998 as ISO/IEC 14882:1998, the current version of which is the 2003 version, ISO/IEC 14882:2003. New version of the standard (known informally as C++0x) is being developed.
In C and C++, the expression x++ increases the value of x by 1 (called incrementing). The name "C++" is a play on this, suggesting an incremental improvement upon C.|}}
- C++3DGame . . . . 1 match
[[TableOfContents]]
Point3D center; // the center of CPU. in world coordinates
Point3D coord[8]; // the 8 corners of the CPU box relatives to the center point
- C++Seminar03 . . . . 1 match
|| [[TableOfContents]] ||
- C/C++어려운선언문해석하기 . . . . 1 match
원문 : How to interpret complex C/C++ declarations (http://www.codeproject.com/cpp/complex_declarations.asp)
변수 p는 int형을 요소로 하는 크기가 4인 배열을 가리키는 포인터(a pointer to an array of 4 ints)이며, 변수 q는 int형 포인터를 요
소로 하는 크기가 5인 배열(an array of 5 pointer to integers) 입니다.
e var[10]; // var is an array of 10 pointers to
(an array of 5 pointers to functions that receive two const pointers to chars and return void pointer)은 어떻게 선언하면 될까요
direction should be reversed. Once everything in the parentheses has been parsed, jump out of it. Continue till the whole
3. Jump out of parentheses and encounter (int) --------- to a function that takes an int as argument
5. Jump put of parentheses, go right and hit [10] -------- to an array of 10
2. Go right, find array subscript --------------------- is an array of 5
4. Jump out of parentheses, go right to find () ------ to functions
// pointer to an array of pointers
(int &) ) [5]; // e is an array of 10 pointers to
// an array of 5 floats.
- C99표준에추가된C언어의엄청좋은기능 . . . . 1 match
The new variable-length array (VLA) feature is partially available. Simple VLAs will work. However, this is a pure coincidence; in fact, GNU C has its own variable-length array support. As a result, while simple code using variable-length arrays will work, a lot of code will run into the differences between the older GNU C support for VLAs and the C99 definition. Declare arrays whose length is a local variable, but don't try to go much further.
- CCNA . . . . 1 match
[[TableOfContents]]
- CCNA/2013스터디 . . . . 1 match
[[TableOfContents]]
- back-off 알고리즘 : 충돌 발생 시에 개별 호스트는 랜덤한 시간이 지난 후에 데이터를 재전송함. 랜덤한 시간인 이유는 대기 시간을 고정시키면 충돌이 일어난 후에 개별 호스트들이 고정 시간만큼 기다리고 나서 데이터 전송 시에 또 충돌이 발생하기 때문.
- SPID(Service Profile Identifiers) : 고유 아이디. 전화번호와 비슷.
- show interface bri : interface들 중에서 bri와 관련된 부분들 보기.
- show dialer : ISDN번호, 주소, 연결 지속시간, 현재 사용하는 채널, Data Link 상태 등의 정보를 보여줌.
- CNight2011 . . . . 1 match
[[TableOfContents]]
- CNight2011/윤종하 . . . . 1 match
[[TableOfContents]]
- COM/DCOMPrimerPlus . . . . 1 match
{{|[[TableOfContents]]|}}
- CPPStudy_2005_1 . . . . 1 match
[http://www.acceleratedcpp.com/ Accelerated C++ Official Site] 각 커파일러의 버전에 맞는 소스코드를 구할 수 있습니다.
[http://msdn.microsoft.com/visualc/vctoolkit2003/ VSC++ Toolkit] .net 을 구입할 수 없는 상태에서 STL을 컴파일 해야할 때 사용하면 되는 컴파일러. (공개)
[http://lab.msdn.microsoft.com/express/visualc/default.aspx VS2005C++Express] .net 2005의 VSC++버전의 Express Edition
- CPPStudy_2005_1/Canvas . . . . 1 match
[[TableOfContents]]
- CPPStudy_2005_1/STL성적처리_2 . . . . 1 match
[[TableOfContents]]
- CPPStudy_2005_1/STL성적처리_2_class . . . . 1 match
[[TableOfContents]]
- CPPStudy_2005_1/STL성적처리_3 . . . . 1 match
[[TableOfContents]]
if(fin.eof()) break;
- CToAssembly . . . . 1 match
[[TableOfContents]]
- CVS/길동씨의CVS사용기ForLocal . . . . 1 match
||[[TableOfContents]]||
void showHelloJava(){
helloJava.showHelloJava();
< void showHelloJava(){
< helloJava.showHelloJava();
- CVS/길동씨의CVS사용기ForRemote . . . . 1 match
[[TableOfContents]]
- CanvasBreaker . . . . 1 match
[[TableOfContents]]
- Chapter I - Sample Code . . . . 1 match
[[TableOfContents]]
uCOS-II는 여타의 DOS Application 과 비슷하다. 다른말로는 uCOS-II의 코드는 main 함수에서부터 시작한다. uCOS-II는 멀티태스킹과 각 task 마다 고유의 스택을 할당하기 때문에, uCOS-II를 구동시키려면 이전 DOS의 상태를 저장시켜야하고, uCOS-II의 구동이 종료되면서 저장된 상태를 불러와 DOS수행을 계속하여야 한다. 도스의 상태를 저장하는 함수는 PC_DosSaveReturn()이고 저장된 DOS의 상태를 불러오는것은 PC_DOSReturn() 함수이다. PC.C 파일에는 ANSI C 함수인 setjmp()함수와 longjmp()함수를 서로 연관시켜서 도스의 상태를 저장시키고, 불러온다. 이 함수는 Borland C++ 컴파일러 라이브러리를 비롯한 여타의 컴파일러 라이브러리에서 제공한다.[[BR]]
- Chapter II - Real-Time Systems Concepts . . . . 1 match
[[TableOfContents]]
Soft / Hard 가 그 두가지 예라고 할 수 있다. Soft Real Time 이란 말은 Task 의 수행이 가능하면 보다 빠르게 진행 될 수 있게 만들어진시스템을 말한다.
=== Critical Section of Code ===
대부분의 리얼타임에서는 SOFT/HARD 리얼타임의 적절한 조합으로 쓰여진다.[[BR]]
SOFT에서는 가능한 보다 빠른 실행을 중시하며 특정시간에 꼭 작업을 마칠 이유는 없다. 반에
=== Advantages and Disadvantages of Real-Time Kernels ===
- Classes . . . . 1 match
[[TableOfContents]]
set softtabstop=4
- ClassifyByAnagram/김재우 . . . . 1 match
e.printStackTrace(); //To change body of catch statement use Options | File Templates.
System.err.println( "Elapsed: " + String.valueOf( System.currentTimeMillis() - start ) );
- ClearType . . . . 1 match
[[TableOfContents]]
Microsoft 에서 주도한 폰트 보정 기법의 하나로 기존의 안티얼라이징 기법과 최근에 나오고 있는 LCD Display 의 표현적 특성을 조합하여 폰트 이미지의 외관을 가히 극대화하여 표현하는 방식.
* [MicroSoft]에서 개발한 텍스트 벡터드로잉 방법.
* [http://www.microsoft.com/typography/ClearTypeInfo.mspx ClearType기술 홈페이지] - 윈도우 적용 방법이나 기술에대한 자세한 소개.
* [http://www.microsoft.com/typography/cleartype/tuner/Step1.aspx ClearType Tuner]라는 프로그램으로 세부적인 클리어타입 셋팅을 할 수 있다.
- Code/RPGMaker . . . . 1 match
[[TableOfContents]]
float[] coordinates = { // position of vertices
float[] uvs = { // how uv mapped?
int[] indices = { // index of each coordinate
// calc normal vector of line
- CompleteTreeLabeling/조현태 . . . . 1 match
[[TableOfContents]]
line=(block**)malloc(sizeof(block*)*number_nodes);
block* temp_block=(block*)malloc(sizeof(block));
temp_block->next=(block**)malloc(sizeof(block*)*input_degree);
line=(block**)malloc(sizeof(block*)*number_nodes);
block* temp_block=(block*)malloc(sizeof(block));
temp_block->next=(block**)malloc(sizeof(block*)*degree);
int number_of_one=get_number_nodes(degree,line[block_number]->deep)-get_number_nodes(degree,line[block_number]->deep-1);
sub_line=(int*)malloc(sizeof(int)*remain);
if (i<number_of_one)
for (int process_combination=0; process_combination<Get_combination(remain,number_of_one); ++process_combination)
for (register int i=0; i<number_of_one; ++i)
for (register int i=number_of_one-1; i>=0; --i)
sub_line=(int*)malloc(sizeof(int)*(get_number_nodes(degree,line[block_number]->deep)-get_number_nodes(degree,line[block_number]->deep-1)));
int gaesu_of_one=0;
++gaesu_of_one;
for (register int k=j+1; k<j+2+gaesu_of_one; ++k )
- ComponentObjectModel . . . . 1 match
[[TableOfContents]]
{{|Component Object Model, or COM, is a Microsoft technology for software componentry. It is used to enable cross-software communication and dynamic object creation in many of Microsoft's programming languages. Although it has been implemented on several platforms, it is primarily used with Microsoft Windows. COM is expected to be replaced to at least some extent by the Microsoft .NET framework. COM has been around since 1993 - however, Microsoft only really started emphasizing the name around 1997.
COM은 소프트웨어 컴포넌트를 위해 만들어진 Microsoft 사의 기술이다. 이는 수많은 MS사의 프로그래밍 언어에서 소프트웨어간 통신과 동적 객체생성을 가능케한다. 비록 이 기술이 다수의 플랫폼상에서 구현이 되기는 하였지만 MS Windows 운영체제에 주로 이용된다. 사람들은 .Net 프레임워크가 COM을 어느정도까지는 대체하리라고 기대한다. COM 은 1993년에 소개되고 1997즈음해서 MS가 강조한 기술이다.
The COM platform has largely been superseded by the Microsoft .NET initiative and Microsoft now focuses its marketing efforts on .NET. To some extent, COM is now deprecated in favour of .NET.
Despite this, COM remains a viable technology with an important software base – for example the popular DirectX 3D rendering SDK is based on COM. Microsoft has no plans for discontinuing COM or support for COM.
There exists a limited backward compatibility in that a COM object may be used in .NET by implementing a runtime callable wrapper (RCW), and .NET objects may be used in COM objects by calling a COM callable wrapper. Additionally, several of the services that COM+ provides, such as transactions and queued components, are still important for enterprise .NET applications.
COM 플랫폼은 Microsoft .NET프레임웍이 나오면서 많은 부분 대체되었다. 또한 Microsoft 사는 이제 .NET에 대한 마케팅을 하는데 노력한다. 약간 더 나아가 생각해보면 .NET을 선호하는 환경에서 이제 사양의 길로 접어들었다.
그렇지만 COM은 여전히 소프트웨어의 중요한 기반들과 함께 실용적인 기술이다. 예를 들자면 DirectX 3D의 레더링 SDK 는 COM에 기반하고 있다. Microsoft 는 COM를 계속 개발할 계획도, 지원할 계획도 가지고 있지 않다.
[http://www.microsoft.com/com/ Microsoft COM Page]
COM is a feature of Windows. Each version of Windows has a support policy described in the Windows Product Lifecycle.
COM continues to be supported as part of Windows.
COM is a planned feature of the coming version of Windows, code-named "Longhorn".
- ComputerNetworkClass . . . . 1 match
[[TableOfContents]]
- ComputerNetworkClass/Report2006/PacketAnalyzer . . . . 1 match
[[TableOfContents]]
자세한 사항은 MSDN 혹은 Network Programming For Microsoft Windows 를 참조하기 바란다.
if (bind(s, (SOCKADDR *)&if0, sizeof(if0)) == SOCKET_ERROR)
if (WSAIoctl(s, SIO_RCVALL, &optval, sizeof(optval),
__intn 1, 2, 4, or 8 bytes depending on the value of n. __intn is Microsoft-specific.
- Cpp/2011년스터디 . . . . 1 match
[[TableOfContents]]
- Cpp에서의멤버함수구현메커니즘 . . . . 1 match
[[TableOfContents]]
- CreativeClub . . . . 1 match
[[TableOfContents]]
- CubicSpline/1002/NaCurves.py . . . . 1 match
def __init__(self, aControlPointListX, aPieceSize):
self.piecewiseLagrange = PiecewiseLagrange(aControlPointListX, aPieceSize)
def __init__(self, aControlPointListX, aPieceSize):
self.pieceSize = aPieceSize
if ((self.pieceSize-1)*(i-1)+self.pieceSize) > self.getCountControlPoints():
return self.controlPointListX[self.getCountControlPoints()-self.pieceSize : self.getCountControlPoints()]
return (self.pieceSize-1)*(i-1)
return (self.pieceSize-1)*(i-1)+self.pieceSize
def getCountPieces(self):
return int(math.ceil( (self.getCountControlPoints()+1) / (self.pieceSize-1) ))
- Curl . . . . 1 match
{{| [[TableOfContents]] |}}
- D3D . . . . 1 match
[[TableOfContents]]
Tricks of the Windows Game Programming Gurus : Fundamentals of 2D and 3D Game Programming. (DirectX, DirectMusic, 3D sound)
int nElem; // number of elements in the polygon
point3 n; // Normal of the plane
// Flip the orientation of the plane
- DNS와BIND . . . . 1 match
|| [[TableOfContents]] ||
리소스 레코드들의 (일반적)순서 - SOA(start of authority) 레코드, NS(name server) 레코드, 기타 레코드, A(address), PTR(pointer), CNAME(canonical name)
- DPSCChapter2 . . . . 1 match
[[TableOfContents]]
Before launching into our descriptions of specific design patterns, we present a case study of sorts, involving multiple patterns. In the Design Pattern preface, the Gang of Four speak about moving from a "Huh?" to an "Aha!" experience with regard to understanding design patterns. We present here a little drama portraying such a transition. It consists of three vignettes: three days in the life of two Smalltalk programmers who work for MegaCorp Insurance Company. We are listening in on conversations between Don (an object newbie, but an experienced business analyst) and Jane (an object and pattern expert). Don comes to Jane with his design problems, and they solve them together. Although the characters are fictitious, the designs are real and have all been part of actual systems written in Smalltalk. Our goal is to demonstrate how, by careful analysis, design patterns can help derive solutions to real-world problems.
디자인 패턴에 대한 구체적인 설명에 들어가기 전에 우리는 다양한 패턴들이 포함된 것들에 대한 예시들을 보여준다. 디자인 패턴 서문에서 GoF는 디자인 패턴을 이해하게 되면서 "Huh?" 에서 "Aha!" 로 바뀌는 경험에 대해 이야기한다. 우리는 여기 작은 단막극을 보여줄 것이다. 그것은 3개의 작은 이야기로 구성되어있다 : MegaCorp라는 보험회사에서 일하는 두명의 Smalltalk 프로그래머의 3일의 이야기이다. 우리는 Don 과(OOP에 대해서는 초보지만 경험있는 사업분석가) Jane (OOP와 Pattern 전문가)의 대화내용을 듣고 있다. Don 은 그의 문제를 Jane에게 가져오고, 그들은 같이 그 문제를 해결한다. 비록 여기의 인물들의 허구의 것이지만, design 은 실제의 것이고, Smalltalk로 쓰여진 실제의 시스템중 일부이다. 우리의 목표는 어떻게 design pattern이 실제세계의 문제들에 대한 해결책을 가져다 주는가에 대해 설명하는 것이다.
2.1 Scene One : State of Confusion
우리의 이야기는 지친표정을 지으며 제인의 cubicle (음.. 사무실에서의 파티클로 구분된 곳 정도인듯. a small room that is made by separating off part of a larger room)로 가는 Don 과 함께 시작한다. 제인은 자신의 cubicle에서 조용히 타이핑하며 앉아있다.
Don : It's this claims-processing workflow system I've been asked to design. I just can't see how the objects will work together. I think I've found the basic objects in the system, but I don't understand how to make sense from their behaviors.
Jane : Can you show me what you've done?
Don : Here, let me show you the section of the requirements document I've got the problem with:
1. Data Entry. This consists of various systems that receive health claims from a variety of different sources. All are logged by assigning a unique identifier. Paper claims and supporting via OCR (optical character recognition) to capture the data associated with each form field.
3. Provider/Plan Match. An automated process attempts to mach the plan (the contract unser which the claim is being paid) and the health care provider (e.g., the doctor) identified on the claim with the providers with which the overall claim processing organization has a contract. If there is no exact match, the program identifies the most likely matches based on soundex technology (an algorithm for finding similar-sounding words). The system displays prospective matches to knowledge workers in order of the likeinhood of the match, who then identify the correct provider.
4. Automatic Adjudication. The system determines whether a claim can be paid and how much to pay if and only if there are no inconsistencies between key data items associated with the claim. If there are inconsistencies, the system "pends" the claim for processing by the appropriate claims adjudicator.
5. Adjudication of Pended Claims. The adjudicator can access the system for a claim history or a representation of the original claim. The adjudicator either approves the claim for payment, specifying the proper amount to pay, or generates correspondence denying the claim.
- DataCommunicationSummaryProject/CellSwitching . . . . 1 match
[[TableOfContents]]
- DataCommunicationSummaryProject/Chapter11 . . . . 1 match
[[TableOfContents]]
- DataCommunicationSummaryProject/Chapter4 . . . . 1 match
[[TableOfContents]]
- DataCommunicationSummaryProject/Chapter5 . . . . 1 match
[[TableOfContents]]
* extra spectrum과 새로운 modulation techniques으로써 가능. CDMA 선호(증가된 스펙트럼의 효율성과 자연스러운 handoff 메카니즘)
* Messaging(패킷) : e-mail과 합쳐진, Extension of paging(뭘까)->(뭐긴 삐삐가 이메일도 가능하다는거지.ㅋㅋ). 지불과 전자 티켓팅
* TDMA에 비해 soft handover가 가능하지만, GSM으로의 업글은 여전히 힘들다.(GSM은 soft handover를 지원하지 않음)
- DataCommunicationSummaryProject/Chapter9 . . . . 1 match
[[TableOfContents]]
=== Types of Networks ===
* 801.11의 soft handoff 메카니즘
- DataStructure/Foundation . . . . 1 match
[[TableOfContents]]
- DataStructure/Graph . . . . 1 match
[[TableOfContents]]
- DataStructure/List . . . . 1 match
[[TableOfContents]]
public void showData()
public void showMenu()
System.out.println("3. Show");
void Add_ToFront(int n)
- DataStructure/Queue . . . . 1 match
[[TableOfContents]]
void Show();
void Queue::Show()
- DataStructure/Stack . . . . 1 match
[[TableOfContents]]
void Show();
void Show()
void Show();
void Stack::Show()
- DataStructure/Tree . . . . 1 match
[[TableOfContents]]
* Keys in Left Subtree < Keys of Node
* Keys in Right Subtree > Keys of Node(고로 순서대로 정렬되어 있어야 한단 말입니다.)
- DatabaseManagementSystem . . . . 1 match
[[TableOfContents]]
- Debugging/Seminar_2005 . . . . 1 match
[[TableOfContents]]
- DebuggingSeminar_2005 . . . . 1 match
{{|[[TableOfContents]]|}}
|| [http://www.compuware.com/products/numega.htm NuMega] || [SoftIce] , DevPartner 개발사 ||
|| [http://www.compuware.com/products/devpartner/softice.htm SoftIce for DevPartner] || 데브파트너랑 연동하여 쓰는 SoftIce, [http://www.softpedia.com/get/Programming/Debuggers-Decompilers-Dissasemblers/SoftICE.shtml Freeware Download] ||
|| [http://msdn.microsoft.com/library/default.asp?url=/library/en-us/tools/tools/rebase.asp ReBase MSDN] || Rebase is a command-line tool that you can use to specify the base addresses for the DLLs that your application uses ||
|| [http://msdn.microsoft.com/library/default.asp?url=/library/en-us/vccore/html/_core_viewing_decorated_names.asp undname.exe] || C++ Name Undecorator, Map file 분석툴 ||
|| [http://msdn.microsoft.com/library/default.asp?url=/library/en-us/vsdebug/html/_core_c_run2dtime_library_debugging_support.asp Debug CRT] || VC++4 에서 지원하기 시작한 C런타임 라이브러리 ||
- DebuggingSeminar_2005/AutoExp.dat . . . . 1 match
[[TableOfContents]]
Visual C++ .net 에 있는 파일이다. {{{~cpp C:\Program Files\Microsoft Visual Studio .NET 2003\Common7\Packages\Debugger}}} 에 존재한다.
; Copyright(c) 1997-2001 Microsoft Corporation. All Rights Reserved.
; windows are automatically expanded to show their most important
; To find what the debugger considers the type of a variable to
; An AutoExpand rule is a line with the name of a type, an equals
; part in angle brackets names a member of the type and an
; type Name of the type (may be followed by <*> for template
; text Any text.Usually the name of the member to display,
; member Name of a member to display.
; format Watch format specifier. One of the following:
; g Shorter of e and f 3./2.,g 1.5
; For details of other format specifiers see Help under:
; The special format <,t> specifies the name of the most-derived
; type of the object. This is especially useful with pointers or
; than just show a member variable or two.
; second argument is the name of the export from the DLL to use. For
CStdioFile =FILE*=<m_pStream> name=<m_strFilename.m_pchData,s>
; see EEAddIn sample for how to use these
- DesignPatterns . . . . 1 match
see also [HowToStudyDesignPatterns], [DoWeHaveToStudyDesignPatterns]
- DesignPatterns/2011년스터디/1학기 . . . . 1 match
* HowToStudyDesignPatterns?
- DesignPatternsExplained . . . . 1 match
{{| [[TableOfContents]] |}}
- DesktopDecoration . . . . 1 match
{{| [[TableOfContents]] |}}
- DevOn . . . . 1 match
[[TableOfContents]]
=== [Gnome] 3.10 즐기기 & [Wayland] 즐기기 ===
* [정진경] - Gnome 3.10 즐기기는 잘 기억나지 않는다... 미안.. 진크리에이터... Wayland는 나름 도움이 되었는데, X 서버가 컴포지터가 인터프로세스 통신을 한다는 사실을 처음 알게 되었다. Wayland는 X 서버와 컴포지터가 합쳐져 있는 형태이고, 프레임버퍼를 위한 API가 제공된다는 것.. 이 부분은 나중에 공부해서 해당 페이지에 자세한 내용을 기술할 필요가 있을 것 같다...
- DevPartner . . . . 1 match
[[TableOfContents]]
a) DPP를 설치하고 나면 도구(Tools) 메뉴에 DevPartner Profiler란 항목이 최상단에 생깁니다.
b) 이놈을 선택한 후, "DevPartner Profiler" 서브 항목을 클릭해서 활성화시킵니다.
솔루션탐색기에서 솔루션의 속성 페이지(ALT+ENTER)를 열면, "Debug with Profiling"이란 항목이 있습니다. 이 항목의 초기값이 none으로 되어 있기 때문에, None이 아닌 값(대부분 native)으로 맞추고 나서 해당 솔루션을 다시 빌드해야합니다. 링크시 "Compuware Linker Driver..."로 시작하는 메시지가 나오면 프로파일링이 가능하도록 실행파일이 만들어진다는 뜻입니다.
- DevelopmentinWindows . . . . 1 match
[[TableOfContents]]
* MFC (Microsoft Foundation Class library)
- DiceRoller . . . . 1 match
[[TableOfContents]]
- DirectX2DEngine . . . . 1 match
[[TableOfContents]]
* SDK는 이 주소로 받으세요 : [http://www.microsoft.com/downloads/info.aspx?na=90&p=&SrcDisplayLang=en&SrcCategoryId=&SrcFamilyId=1FD20DF1-DEC6-47D0-8BEF-10E266DFDAB8&u=http%3a%2f%2fdownload.microsoft.com%2fdownload%2f5%2ff%2fd%2f5fd259d5-b8a8-4781-b0ad-e93a9baebe70%2fdxsdk_jun2006.exe DOWNLOAD]
- Django스터디2006 . . . . 1 match
[[TableOfContents]]
- DoubleBuffering . . . . 1 match
[[TableOfContents]]
- EditPlus . . . . 1 match
[[TableOfContents]]
- EffectiveSTL/Container . . . . 1 match
[[TableOfContents]]
= Item2. Beware the illusion of container-independant code. =
["MoreEffectiveC++/Techniques1of3"] 의 Item 28 을 봐라. 영문을 보는것이 더 좋을것이다. ["MoreEffectiveC++"] 의 전자책과 아날로그 모두다 소장하고 있으니 필요하면 말하고, 나도 이 책 정리 할려고 했는데, 참여하도록 노력하마 --["상민"]
= Item4. Call empty instead of checking size() against zero. =
= Item7. When using containers of newed pointers, remember to delete the pointers before the container is destroyed =
= Item8. Never create containers of auto_ptrs. =
= Item10. Be aware of allocator conventions and restrictions. =
= Item11. Understand the legitimte uses of custom allocators. =
= Item12. Have realistic expectations about the thread safety of STL containers. =
- EffectiveSTL/Iterator . . . . 1 match
[[TableOfContents]]
= Item28. Understand how to use a reverse_iterator's base iterator =
- EffectiveSTL/ProgrammingWithSTL . . . . 1 match
[[TableOfContents]]
= Item46. Consider function objects instead of functions as algorithm parameters. =
- EffectiveSTL/VectorAndString . . . . 1 match
[[TableOfContents]]
= Item15. Be aware of variations in string implementations. =
= Item16. Know how to pass vector and string data to legacy APIS =
- EightQueenProblemSecondTryDiscussion . . . . 1 match
제가 보기에 현재의 디자인은 class 키워드만 빼면 절차적 프로그래밍(procedural programming)이 되는 것 같습니다. 오브젝트 속성은 전역 변수가 되고 말이죠. 이런 구성을 일러 God Class Problem이라고도 합니다. AOP(Action-Oriented Programming -- 소위 Procedural Programming이라고 하는 것) 쪽에서 온 프로그래머들이 자주 만드는 실수이기도 합니다. 객체지향 분해라기보다는 한 거대 클래스 내에서의 기능적 분해(functional decomposition)가 되는 것이죠. Wirfs-Brock은 지능(Intelligence)의 고른 분포를 OOD의 중요요소로 뽑습니다. NQueen 오브젝트는 그 이름을 "Manager"나 "Main''''''Controller"로 바꿔도 될 정도로 모든 책임(responsibility)을 도맡아 하고 있습니다 -- Meyer는 하나의 클래스는 한가지 책임만을 제대로 해야한다(A class has a single responsibility: it does it all, does it well, and does it only )고 말하는데, 이것은 클래스 이름이 잘 지어졌는지, 얼마나 구체성을 주는지 등에서 알 수 있습니다. (Coad는 "In OO, a class's statement of responsibility (a 25-word or less statement) is the key to the class. It shouldn't have many 'and's and almost no 'or's."라고 합니다. 만약 이게 자연스럽게 되지않는다면 클래스를 하나 이상 만들어야 한다는 얘기가 되겠죠.) 한가지 가능한 지능 분산으로, 여러개의 Queen 오브젝트와 Board 오브젝트 하나를 만드는 경우를 생각해 볼 수 있겠습니다. Queen 오브젝트 갑이 Queen 오브젝트 을에게 물어봅니다. "내가 너를 귀찮게 하고 있니?" --김창준
Wiki:TellDontAsk 라고 합니다. (see also Wiki:LawOfDemeter)
- Ellysavet . . . . 1 match
[[TableOfContents]]
- EmbeddedSystemClass . . . . 1 match
[[TableOfContents]]
- English Speaking/The Simpsons/S01E04 . . . . 1 match
* Police Officer 1, 2 : [송지원]
Moe : What's-a matter, Homer? Bloodiest fight of the year.
Police 2 : Good one, Moe. We're looking for a family of Peeping Toms...
Homer : You can't talk that way about my kids! Or at least two of them.
- EnglishSpeaking/2011년스터디 . . . . 1 match
[[TableOfContents]]
* There are four members in my family: my father, mother, and a younger brother. Well, actually there are five including our dog. My father was a military officer for twenty years. He recently retired from service and now works in a weaponry company. My mother is a typical housewife. She takes care of me and my brother and keeps our house running well. My brother is attending a university in the U.S.A. He just entered the university as a freshman and is adjusting to the environment. I miss the memory of fighting over things with him. The last member of my family is my dog named Joy. She is a Maltese terrier and my mother named her Joy to bring joy into our family. That's about it for the introduction of my family members.
* [김수경] - 이번주 영상은 문장이 단어 조금 바꾸면 여기저기 가져다 쓸만한 것이 많아 재미있었어요. 가위바위보로 역할을 분담했는데 ''Along with the ego and the superego, one of three components of the psyche.''라는 문장을 외워보고 싶어서 리사를 선택했습니다. 그런데 리사 분량이 제일 적어서 본의아니게(?) 가장 날로먹었네요 ㅋㅋ
- EnglishSpeaking/TheSimpsons/S01E03 . . . . 1 match
Lisa : How 'bout this? Supervising technician at the toxic waste dump.
You've caused plenty of industrial accidents, and you've always bounced back.
- EnglishSpeaking/TheSimpsons/S01E04 . . . . 1 match
* Police Officer 1, 2 : [송지원]
Moe : What's-a matter, Homer? Bloodiest fight of the year.
Police 2 : Good one, Moe. We're looking for a family of Peeping Toms...
Homer : You can't talk that way about my kids! Or at least two of them.
- EventDrvienRealtimeSearchAgency . . . . 1 match
[[TableOfContents]]
- ExploringWorld/20040315-새출발 . . . . 1 match
* Tomcat 설치 port 8080, How To Program Java(학교 교재)의 뒷부분에 JSP 부분을 참고하였다.
- ExtremeProgramming . . . . 1 match
See Also HowToStudyXp , ["XpQuestion"]
- Flex . . . . 1 match
[[TableOfContents]]
- FoundationOfASP . . . . 1 match
[[TableOfContents]]
- GDBUsage . . . . 1 match
[[TableOfContents]]
The GNU Debugger, usually called just GDB, is the standard debugger for the GNU software system. It is a portable debugger that runs on many Unix-like systems and works for many programming languages, including C, C++, and FORTRAN.
Copyright 2005 Free Software Foundation, Inc.
GDB is free software, covered by the GNU General Public License, and you are
welcome to change it and/or distribute copies of it under certain conditions.
Type "show copying" to see the conditions.
There is absolutely no warranty for GDB. Type "show warranty" for details.
FUNCTION, to edit at the beginning of that function,
Execute the rest of the line as a shell command.
- GUIProgramming . . . . 1 match
{{|[[TableOfContents]]|}}
Related) [MicrosoftFoundationClasses]
- GameProgrammingGems . . . . 1 match
[[TableOfContents]]
- Garbage collector for C and C++ . . . . 1 match
# of objects to be recognized. (See gc_priv.h for consequences.)
# causes all objects to be padded so that pointers just past the end of
# -DNO_SIGNALS does not disable signals during critical parts of
# the GC process. This is no less correct than many malloc
# impact. However, it is dangerous for many not-quite-ANSI C
# This is on by default. Turning it off has not been extensively tested with
# -DNO_EXECUTE_PERMISSION may cause some or all of the heap to not
# See gc_cpp.h for details. No effect on the C part of the collector.
# Calloc and strdup are redefined in terms of the new malloc. X should
# existing code, but it often does. Neither works on all platforms,
# Reduces code size slightly at the expense of debuggability.
# -DJAVA_FINALIZATION makes it somewhat safer to finalize objects out of
# of GC_java_finalization variable.
# initial value of GC_finalize_on_demand.
# -DHBLKSIZE=ddd, where ddd is a power of 2 between 512 and 16384, explicitly
# kind of object. For the incremental collector it makes sense to match
# -DUSE_MMAP use MMAP instead of sbrk to get new memory.
# value of the near-bogus-pointer. Can be used to identifiy regions of
# to determine how particular or randomly chosen objects are reachable
# for debugging/profiling purposes. The gc_backptr.h interface is
- GarbageCollection . . . . 1 match
[[TableOfContents]]
2번째 경우에 대한 힌트를 학교 자료구조 교재인 Fundamentals of data structure in c 의 Linked List 파트에서 힌트를 얻을 수 있고, 1번째의 내용은 원칙적으로 완벽한 예측이 불가능하기 때문에 시스템에서 객체 참조를 저장하는 식으로 해서 참조가 없으면 다시는 쓰지 않는 다는 식으로 해서 처리하는 듯함. (C++ 참조 변수를 통한 객체 자동 소멸 관련 내용과 관련한 부분인 듯, 추측이긴 한데 이게 맞는거 같음;;; 아닐지도 ㅋㅋㅋ)
- Gof/AbstractFactory . . . . 1 match
[[TableOfContents]]
- Gof/Adapter . . . . 1 match
[[TableOfContents]]
We'll give a brief sketch of the implementation of class and object adapters for the Motivation example beginning with the classes Shape and TextView.
Shape assumes a bounding box defined by its opposing corners. In contrast, TextView is defined by an origin, height, and width. Shape also defines a CreateManipulator operation for creating a Manipulator object, which knowns how to animate a shape when the user manipulates it. TextView has no equivalent operation. The class TextShape is an adapter between these different interfaces.
The IsEmpty operations demonstrates the direct forwarding of requests common in adapter implementations:
Finally, we define CreateManipulator (which isn't supported by TextView) from scratch. Assume we've already implemented a TextManipulator class that supports manipulation of a TextShape.
Compare this code the class adapter case. The object adapter requires a little more effort to write, but it's more flexible. For example, the object adapter version of TextShape will work equally well with subclasses of TextView -- the client simply passes an instance of a TextView subclass to the TextShape constructor.
- Gof/Facade . . . . 1 match
From GoF.
[[TableOfContents]]
예를 들어, 가상 메모리 framework는 Domain을 facade로서 가진다. Domain은 address space를 나타낸다. Domain은 virtual addresses 와 메모리 객체, 화일, 저장소의 offset에 매핑하는 기능을 제공한다. Domain의 main operation은 특정 주소에 대해 메모리 객체를 추가하거나, 삭제하너가 page fault를 다루는 기능을 제공한다.
- Gof/Mediator . . . . 1 match
[[TableOfContents]]
Here's the succession of events by which a list box's selection passes to an entry field.
DialogDirect는 다이얼로그의 전체 행위를 정의한 추상 클래스이다. client들은 화면에 다이얼로그를 나타내기 위해서 ShowDialog 연산자를 호출한다. CreateWidgets는 다이얼로그 도구들을 만들기 위한 추상 연산자이다. WidgetChanged는 또 다른 추상 연산자이며, 도구들은 director에게 그들이 변했다는 것을 알려주기 위해서 이를 호출한다. DialogDirector subclass들은 CreateWidgets을 적절한 도구들을 만들기 위해서 override하고 그리고 그들은 WidgetChanged를 변화를 다루기 위해서 override한다.
virtual void ShowDialog();
- Gof/Strategy . . . . 1 match
[[TableOfContents]]
* 당신은 알고리즘의 다양함을 필요로 한다. 예를 들어, 당신이 알고리즘을 정의하는 것은 사용메모리/수행시간에 대한 trade-off (메모리를 아끼기 위해 수행시간을 희생해야 하거나, 수행시간을 위해 메모리공간을 더 사용하는 것 등의 상관관계)이다. Strategy 는 이러한 다양한 알고리즘의 계층 클래스를 구현할때 이용될 수 있다.
* Borland's ObjectWindows - dialog box. validation streategies.
- Gof/Visitor . . . . 1 match
[[TableOfContents]]
- declares a Visit operations for each class of ConcreteElement in the object structure. The operation's name and signature identifies the class that sends the Visit request to the visitor. That lets the visitor determine the concrete class of the element being visited. Then the visitor can access the element directly through its particular interface.
- implements each operation declared by Visitor. Each operation implements a fragment of the algorithm defined for the corresponding class of object in the structure. ConcreteVisitor provides the context for the algorithm and stores its local state. This state often accumulates result during the traversal of the structure.
// and so on for other concrete subclasses of Equipment
- Googling . . . . 1 match
{{|[[TableOfContents]]|}}
- Hacking . . . . 1 match
[[TableOfContents]]
== DDOS(Distributed Denial of Service)의 공격 ==
- HaskellLanguage . . . . 1 match
[[TableOfContents]]
Multiple declarations of `Main.f'
- HeadFirstDesignPatterns . . . . 1 match
Official Support Site : http://www.wickedlysmart.com
- I received the book yesterday and I started to read it on the way home... and I couldn't stop, took it to the gym and I expect people must have seen me smile a lot while I was exercising and reading. This is tres "cool". It is fun but they cover a lot of ground and in particular they are right to the point.
{{{Erich Gamma, IBM Distinguished Engineer, and coauthor of "Design Patterns: Elements of Reusable Object-Oriented Software" }}}
- I feel like a thousand pounds of books have just been lifted off my head.
{{{Ward Cunningham, inventor of the Wiki and founder of the Hillside Group}}}
- Header 정의 . . . . 1 match
== How ==
- HelpForDevelopers . . . . 1 match
[[TableOfContents]]
- HelpOnHeadlines . . . . 1 match
See also TableOfContentsMacro
- HelpOnInstallation . . . . 1 match
[[TableOfContents]]
- HelpOnUpdating . . . . 1 match
[[TableOfContents]]
- HierarchicalDatabaseManagementSystem . . . . 1 match
A hierarchical database is a kind of database management system that links records together in a tree data structure such that each record type has only one owner (e.g., an order is owned by only one customer). Hierarchical structures were widely used in the first mainframe database management systems. However, due to their restrictions, they often cannot be used to relate structures that exist in the real world.
Hierarchical relationships between different types of data can make it very easy to answer some questions, but very difficult to answer others. If a one-to-many relationship is violated (e.g., a patient can have more than one physician) then the hierarchy becomes a network.
- HowToBuildConceptMap . . . . 1 match
How To Build a Concept Map
1. Identify a focus question that addresses the problem, issues, or knowledge domain you wish to map. Guided by this question, identify 10 to 20 concepts that are pertinent to the question and list these. Some people find it helpful to write the concept labels on separate cards or Post-its so taht they can be moved around. If you work with computer software for mapping, produce a list of concepts on your computer. Concept labels should be a single word, or at most two or three words.
* Rank order the concepts by placing the broadest and most inclusive idea at the top of the map. It is sometimes difficult to identify the boradest, most inclusive concept. It is helpful to reflect on your focus question to help decide the ranking of the concepts. Sometimes this process leads to modification of the focus question or writing a new focus question.
* Begin to build your map by placing the most inclusive, most general concept(s) at the top. Usually there will be only one, two, or three most general concepts at the top of the map.
* Next selet the two, three or four suboncepts to place under each general concept. Avoid placing more than three or four concepts under any other concept. If there seem to be six or eight concepts that belong under a major concept or subconcept, it is usually possible to identifiy some appropriate concept of intermediate inclusiveness, thus creating another level of hierarchy in your map.
* Connect the concepts by lines. Label the lines with one or a few linking words. The linking words should define the relationship between the two concepts so that it reads as a valid statement or proposition. The connection creates meaning. When you hierarchically link together a large number of related ideas, you can see the structure of meaning for a given subject domain.
* Rework the structure of your map, which may include adding, subtracting, or changing superordinate concepts. You may need to do this reworking several times, and in fact this process can go on idenfinitely as you gain new knowledge or new insights. This is where Post-its are helpful, or better still, computer software for creating maps.
* Look for crosslinks between concepts in different sections of the map and label these lines. Crosslinks can often help to see new, creative relationships in the knowledge domain.
* Specific examples of concepts can be attached to the concept labels (e.g., golden retriver is a specific example of a dog breed).
* Concept maps could be made in many different forms for the same set of concepts. There is no one way to draw a concept map. As your understanding of relationships between concepts changes, so will your maps.
- HowToReadIt . . . . 1 match
NoSmok:HowToReadIt
- ISBN_Barcode_Image_Recognition . . . . 1 match
[[TableOfContents]]
* EAN-13의 심볼로지에 대해 잘 설명되어 있는 페이지(영문) : http://www.barcodeisland.com/ean13.phtml
- Ieee754Standard . . . . 1 match
* [http://www.cs.berkeley.edu/~wkahan/JAVAhurt.pdf How JAVA's Floating-Point Hurts Everyone Everywhere]
- IndexingScheme . . . . 1 match
* Like''''''Pages (at the bottom of each page)
and {{{~cpp [[TableOfContents]]}}}
- InsideCPU . . . . 1 match
[[TableOfContents]]
|| offset || field description ||
|| 0Eh || Nums of reserved sectors ||
|| 10h || Nums of FATs||
- IntegratedDevelopmentEnvironment . . . . 1 match
[[TableOfContents]]
- IntelliJUIDesigner . . . . 1 match
[[TableOfContents]]
- ItMagazine . . . . 1 match
* SoftwareDevelopmentMagazine
* CommunicationsOfAcm
* IeeeSoftware
- JAVAStudy_2002 . . . . 1 match
[[TableOfContents]]
- JTDStudy . . . . 1 match
* What is JUnit? How use this?
- JUnit/Ecliipse . . . . 1 match
[[TableOfContents]]
- Java/JDBC . . . . 1 match
[[TableOfContents]]
- Java/JSP . . . . 1 match
[[TableOfContents]]
- Java2MicroEdition . . . . 1 match
[[TableOfContents]]
* J2ME는 Configuration과 Profile로 구성되어 있다. (아래 "Configuration과 Profile" 참고)
* Profile : Foundation Profile
* Profile : Mobile Information Device Profile (MIDP)
그림을 보면 맨 아래에 MID, 즉 휴대전화의 하드웨어 부분이 있고 그 위에는 Native System Software가 존재하며 그 상위에 CLDC가, 그리고 MIDP에 대한 부분이 나오는데 이 부분을 살펴보면, MIDP Application과 OEM-Specific Classes로 나뉘어 있는 것을 알 수 있다. 여기서의 OEM-Specific Classes라는 것은 말 그대로 OEM(Original Equipment Manufacturing) 주문자의 상표로 상품을 제공하는 것이다. 즉, 다른 휴대전화에서는 사용할 수 없고, 자신의(같은 통신 회사의) 휴대전화에서만 독립적으로 수행될 수 있도록 제작된 Java또는 Native로 작성된 API이다. 이는 자신의(같은 통신 회사의) 휴대전화의 특성을 잘 나타내거나 또는 MIDP에서 제공하지 않는 특성화된 클래스 들로 이루어져 있다. 지금까지 나와있는 많은 MIDP API들에도 이런 예는 많이 보이고 있으며, 우리나라의 SK Telecom에서 제공하는 SK-VM에도 이런 SPEC을 가지고 휴대전화의 특성에 맞는 기능, 예를 들어 진동 기능이나, SMS를 컨트롤하는 기능 들을 구현하고 있다. 그림에서 보듯이 CLDC는 MIDP와 OEM-Specific Classes의 기본이 되고 있다.
=== Configuration과 Profile ===
- JavaHTMLParsing/2011년프로젝트 . . . . 1 match
[[TableOfContents]]
HOW???
- JavaScript/2011년스터디 . . . . 1 match
[[TableOfContents]]
- JavaScript/2011년스터디/3월이전 . . . . 1 match
[[TableOfContents]]
- JavaScript/2011년스터디/7월이전 . . . . 1 match
[[TableOfContents]]
* http://www.synapsoft.co.kr/11/recruit1.jsp 의 스펙을 읽고 Map을 화면에 띄움.
- JavaScript/2011년스터디/김수경 . . . . 1 match
[[TableOfContents]]
// Call the inherited version of dance()
p instanceof Person && p instanceof Class &&
n instanceof Ninja && n instanceof Person && n instanceof Class
prototype[name] = typeof prop[name] == "function" &&
typeof _super[name] == "function" && fnTest.test(prop[name]) ?
// Allows for instanceof to work:
(new Ninja()) instanceof Person
- JavaScript/2011년스터디/서지혜 . . . . 1 match
[[TableOfContents]]
- JavaStudy2002 . . . . 1 match
||[[TableOfContents]]||
- JavaStudy2004 . . . . 1 match
* 추천도서 - Java HowToProgram - Deitel사. 2학년 전공 JavaProgrammingClass에서 교재로 사용하는 책. 간단하고 쉽다. 자바를 처음 시작하는 이에게 추천도서
- JavaStudyInVacation . . . . 1 match
||[[TableOfContents]]||
- JosephYoder방한번개모임 . . . . 1 match
[[TableOfContents]]
Joseph Yoder와의 만남. 신선했다면 신선했다일까. 이렇게 빠른 외국인의 아키텍쳐설명은 들어본적이 없다. Pattern의 강자 GoF와 같이 시초를 같이 했으며 의료 분야 소프트웨어 제작에 참여하고있다고 했다.
처음에 더러운 코드를 뜻하는 Big Ball of Mud에 대해 얘기했는데 첨에는 못알아듣다가 텍사스에서 땅값이 비싸서 멋진 아키텍쳐로 높게 지은 빌딩과 얽기설기 있는 브라질의 판자촌을 보고 깨달았다. 나는 그저 메모리도 많이쓰고 비싼 땅값을 주는곳에서 쓰지못하는 판자촌 짓는 사람이라고. 젠장 땅값 적게 나가게 집을 올려야지.
* big ball of mud
- JuneTemplate . . . . 1 match
[[TableOfContents]]
- Jython . . . . 1 match
[[TableOfContents]]
- KIV봉사활동/예산 . . . . 1 match
[[tableOfContents]]
- KIV봉사활동/자료 . . . . 1 match
[[tableOfContents]]
- Knapsack . . . . 1 match
처음부터 단박에 이 문제를 푸는 것보다 조금 더 제한적이고 쉬운 문제에서 일반적이고 어려운 문제로 점진적으로 진행해 나가는 것은 어떨까요. NoSmok:HowToSolveIt 에서 소개하는 문제 해결 테크닉 중 하나이기도 하죠. 훨씬 더 높은 교육적 효과를 기대할 수 있지 않을까 합니다.
- KnowledgeManagement . . . . 1 match
[[TableOfContents]]
- Kongulo . . . . 1 match
# * Redistributions of source code must retain the above copyright
# notice, this list of conditions and the following disclaimer.
# copyright notice, this list of conditions and the following disclaimer
# * Neither the name of Google Inc. nor the names of its
# this software without specific prior written permission.
# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
# Digs out the text of an HTML document's title.
password for each user-id/substring-of-domain that the user provided using
"""Strip repeated sequential definitions of same user agent, then
URL. This is based on the type of the URL (only crawl http URLs) and robot
rules. Maintains a cache of robot rules already fetched.'''
self.robots = {} # Dict of robot URLs to robot parsers
'''This object holds the state of the crawl, and performs the crawl.'''
self.rules = UrlValidator(options.match) # Cache of robot rules etc.
- LIB_4 . . . . 1 match
*Stack-- = (INT16U)FP_OFF(task);
*Stack-- = (INT16U)FP_OFF(task);
INT16U StackOff;
- LawOfDemeter . . . . 1 match
다음은 http://www.pragmaticprogrammer.com/ppllc/papers/1998_05.html 중 'Law Of Demeter' 에 대한 글.
nilly? Well, you could, but that would be a bad idea, according to the Law of Demeter. The Law of Demeter
What that means is that the more objects you talk to, the more you run the risk of getting broken when one
of them changes. So not only do you want to say as little as possible, you don't want to talk to more
objects than you need to either. In fact, according to the Law of Demeter for Methods, any method of an
This is what we are trying to prevent. (We also have an example of Asking instead of Telling in foo.getKey
()). Direct access of a child like this extends coupling from the caller farther than it needs to be. The
The disadvantage, of course, is that you end up writing many small wrapper methods that do very little but
delegate container traversal and such. The cost tradeoff is between that inefficiency and higher class
The higher the degree of coupling between classes, the higher the odds that any change you make will break
Depending on your application, the development and maintenance costs of high class coupling may easily
of maintaining these as separate methods. Why bother?
It helps to maintain the "Tell, Don't Ask" principle if you think in terms of commands that perform a very
tossing data out, you probably aren't thinking much in the way of invariants).
If you can assume that evaluation of a query is free of any side effects, then you can:
The last, of course, is why Eiffel requires only side-effect free methods to be called from within an
Assertion. But even in C++ or Java, if you want to manually check the state of an object at some point in
- LearningToDrive . . . . 1 match
I can remeber clearly the day I first began learning to drive. My mother and I were driving up Interstate 5 near Chico, California, a horizon. My mom had me reach over from the passenger seat and hold the steering wheel. She let me get the feel of how motion of the wheel affected the dirction of the car. Then she told me, "Here's how you drive. Line the car up in the middle of the lane, straight toward the horizon."
I very carefully squinted straight down the road. I got the car smack dab in the middle of the lane, pointed right down the middle of the road. I was doing great. My mind wandered a little...
This is the paradigm for XP. There is no such thing as straight and level. Even if things seem to be going perfectly, you don't take your eyes off the road. Change is the only constant. Always be prepared to move a little this way, a little that way. Sometimes maybe you have to move in a completely different direction. That's life as a programmer.
Everythings in software changes. The requirements change. The design changes. The business changes. The technology changes. The team changes. The team members change. The problem isn't change, per se, because change is going to happen; the problem, rather, is the inability to cope with change when it comes.
The driver of a software project is the customer. If the software doesn't do what they want it to do, you have failed. Of course, they don't know exactly what the software should do. That's why software development is like steering, not like getting the car pointed straight down the road. Out job as programmers is to give the customer a steering wheel and give them feedback about exactly where we are on the road.
소프트웨어 개발을 운전을 배우는 것에 비유한 설명이 재미있네요. software project 의 Driver 는 customer 라는 말과.. Programmer 는 customer 에게 운전대를 주고, 그들에게 우리가 정확히 제대로 된 길에 있는지에 대해 feedback 을 주는 직업이라는 말이 인상적이여서. 그리고 customer 와 programmer 와의 의견이 수렴되어가는 과정이 머릿속으로 그려지는 것이 나름대로 인상적인중. 그리고 'Change is the only constant. Always be prepared to move a little this way, a little that way. Sometimes maybe you have to move in a completely different direction. That's life as a programmer.' 부분도.. 아.. 부지런해야 할 프로그래머. --;
- LexAndYacc . . . . 1 match
[[TableOfContents]]
- LightMoreLight/허아영 . . . . 1 match
If the Number of n's measure is an odd number, an answer is "No"
else if the Number of n's measure is an even number, an answer is "Yes".
How do I code this contents??
I learned how to solve the Number of n's measure.. at a middle school.
- LinearAlgebraClass . . . . 1 match
길버트 스트랭은 선형대수학 쪽에선 아주 유명한 사람으로, 그이의 ''Introduction to Linear Algebra''는 선형대수학 입문 서적으로 정평이 나있다. 그의 MIT 수업을 이토록 깨끗한 화질로 "공짜로" 한국 안방에 앉아서 볼 수 있다는 것은 축복이다. 영어 듣기 훈련과 수학공부 두마리를 다 잡고 싶은 사람에게 강력 추천한다. 선형 대수학을 들었던(그리고 학기가 끝나고 책으로 캠프화이어를 했던) 사람이라면 더더욱 추천한다. (see also HowToReadIt 같은 대상에 대한 다양한 자료의 접근) 대가는 기초를 어떻게 가르치는가를 유심히 보라. 내가 학교에서 선형대수학 수강을 했을 때, 이런 자료가 있었고, 이런 걸 보라고 알려주는 사람이 있었다면 학교 생활이 얼마나 흥미진지하고 행복했을지 생각해 보곤 한다. --JuNe
- LinkedList . . . . 1 match
[[TableOfContents]]
- Linux . . . . 1 match
[[TableOfContents]]
professional like gnu) for 386(486) AT clones. This has been brewing
(same physical layout of the file-system (due to practical reasons)
PS. Yes - it's free of any minix code, and it has a multi-threaded fs.
[http://www.zeropage.org/pub/Linux/Microsoftware_Linux_Command.pdf 마이크로소프트웨어_고급_리눅스_명령와_중요_시스템_관리]
[http://translate.google.com/translate?hl=ko&sl=en&u=http://www.softpanorama.org/People/Torvalds/index.shtml&prev=/search%3Fq%3Dhttp://www.softpanorama.org/People/Torvalds/index.shtml%26hl%3Dko%26lr%3D 리눅스의 개발자 LinusTorvalds의 소개, 인터뷰기사등]
- Linux/RegularExpression . . . . 1 match
[[TableOfContents]]
- Linux/디렉토리용도 . . . . 1 match
[[TableOfContents]]
* /etc/profile.d : 쉘 로그인 하여 프로파일의 실행되는 스크립트에 대한 정의가 있음.
- Linux/배포판 . . . . 1 match
[[TableOfContents]]
- Linux/필수명령어 . . . . 1 match
[[TableOfContents]]
|| chown <id> <파일> || 파일 소유주(owner) 변경||
- LinuxProgramming/QueryDomainname . . . . 1 match
memset(&addr, 0, sizeof(addr));
printf("Officially name : %s \n\n", host->h_name);
- LinuxProgramming/SignalHandling . . . . 1 match
[[TableOfContents]]
SIGBUS - bus error "access to undefined portion of memory object"(SUS)
SIGPROF - profiling timer expired
- LinuxServer . . . . 1 match
[[TableOfContents]]
- LogicCircuitClass . . . . 1 match
[[TableOfContents]]
= Who is a professor? =
- MFC Study 2006 . . . . 1 match
[[TableOfContents]]
- MFC/AddIn . . . . 1 match
{{| [[TableOfContents]] |}}
- MFC/CObject . . . . 1 match
{{| [[TableOfContents]] |}}
- MFC/CollectionClass . . . . 1 match
{{| [[TableOfContents]] |}}
해싱과정은 해시값이라는 정수를 생성한다. 일반적으로 키와 그리고 연된 객체를 맵안의 어디에 저장할 것인가를 결정하기 위해서 기본 어드레스에 대한 offset 으로 해시갑이 설정된다.
- MFC/Control . . . . 1 match
{{| [[TableOfContents]] |}}
= a kind of control =
- MFC/DeviceContext . . . . 1 match
{{|[[TableOfContents]]|}}
- MFC/DynamicLinkLibrary . . . . 1 match
{{| [[TableOfContents]] |}}
- MFC/HBitmapToBMP . . . . 1 match
header.bfSize = size+sizeof(BITMAPFILEHEADER);
header.bfOffBits = sizeof(BITMAPFILEHEADER)+sizeof(BITMAPINFOHEADER)+
sizeof(RGBQUAD)*palsize;
if (fwrite(&header,sizeof(BITMAPFILEHEADER),1,fp)!=0)
*size = sizeof(BITMAPINFOHEADER)+sizeof(RGBQUAD)*palsize+width*h;
lpbi = (BYTE *)lpvBits+sizeof(BITMAPINFOHEADER) +
sizeof(RGBQUAD)*palsize;
lpvBits->bmiHeader.biSize = sizeof(BITMAPINFOHEADER);
- MFC/MessageMap . . . . 1 match
{{|[[TableOfContents]]|}}
// DO NOT EDIT what you see in these blocks of generated code !
// DO NOT EDIT what you see in these blocks of generated code!
#define WM_SHOWWINDOW 0x0018
* lParam of WM_COPYDATA message points to...
- MFC/ObjectLinkingEmbedding . . . . 1 match
[[TableOfContents]]
- MFC/RasterOperation . . . . 1 match
{{| [[TableOfContents]] |}}
- MFC/ScalingMode . . . . 1 match
{{|[[TableOfContents]]|}}
- MFC/Serialize . . . . 1 match
{{| [[TableOfContents]] |}}
- MFC/Socket . . . . 1 match
[[TableOfContents]]
- MFCStudy_2001 . . . . 1 match
[[TableOfContents]]
- MFCStudy_2001/MMTimer . . . . 1 match
[[TableOfContents]]
- MFCStudy_2001/진행상황 . . . . 1 match
[[TableOfContents]]
- MFCStudy_2002_1 . . . . 1 match
[[TableOfContents]]
- MFCStudy_2002_2 . . . . 1 match
[[TableOfContents]]
- MacroMarket . . . . 1 match
moinmoin의 Macro 관련 페이지. {{{~cpp [[TableOfContents]], [[BR]] }}} 등등은 일종의 moinmoin 플러그인으로 파이썬을 이용, 향후 추가가 가능합니다.
- McConnell . . . . 1 match
[[TableOfContents]]
- MemeHarvester . . . . 1 match
[[TableOfContents]]
- MicrosoftFoundationClasses . . . . 1 match
[[TableOfContents]]
Microsoft Foundation Classes 를 줄여서 부른다. 기정의된 클래스의 집합으로 Visual C++이 이 클래스들을 가반으로 하고 있다. 이 클래스 군은 MS Windows API를 래핑(Wrapping)하여서 객체지향적 접근법으로 프로그래밍을 하도록 설계되어 있다. 예전에는 볼랜드에서 내놓은 OWL(Object Windows Library)라는 것도 쓰였던 걸로 아는데... -_-; 지금은 어디로 가버렸는지 모른다. ㅋㅋ
''백과사전) WikiPedia:Microsoft_Foundation_Classes, WikiPedia:Object_Windows_Library ''
m_pMainWnd->ShowWindow(m_nCmdShow);
Upload:simple_mfc_window_showing.JPG [[BR]]
- MineFinder . . . . 1 match
[[TableOfContents]]
=== Profiling ===
Profile: Function timing, sorted by time
Time outside of functions: 28.613 millisecond
Percent of time in module: 100.0%
- MobileJavaStudy/Tip . . . . 1 match
[[TableOfContents]]
- ModelViewPresenter . . . . 1 match
어플리케이션을 이러한 방법으로 나누는 것은 좋은 SeparationOfConcerns 이 되며, 다양한 부분들을 재사용할 수 있도록 해준다.
Model-View-Presenter or MVP is a next generation programming model for the C++ and Java programming languages. MVP is based on a generalization of the classic MVC programming model of Smalltalk and provides a powerful yet easy to understand design methodology for a broad range of application and component development tasks. The framework-based implementation of these concepts adds great value to developer programs that employ MVP. MVP also is adaptable across multiple client/server and multi-tier application architectures. MVP will enable IBM to deliver a unified conceptual programming model across all its major object-oriented language environments.
- ModelingSimulationClass_Exam2006_1 . . . . 1 match
[[TableOfContents]]
- MoinMoinBugs . . . . 1 match
Back to MoinMoinTodo | Things that are MoinMoinNotBugs | MoinMoinTests contains tests for many features
[[TableOfContents]]
''Yes, by design, just like headings don't accept trailing spaces. In the case of headings, it is important because "= x =" is somewhat ambiguous. For tables, the restriction could be removed, though.''
And as a fun sidenote, the UserPreferences cookie doesn't seem to work. The cookie is in my ~/.netscape/cookies file still. My EfnetCeeWiki and XmlWiki cookies are duplicated!? It is kind of like the bug you found when I, ChristianSunesson, tried this feature with netscape just after you deployed it.
* Solve the problem of the Windows filesystem handling a WikiName case-indifferent (i.e. map all deriatives of an existing page to that page).
* InterWiki links should either display the destination Wiki name or generate the A tag with a TITLE attribute so that (at least in IE) the full destination is displayed by floating the cursor over the link. At the moment, it's too hard to figure out where the link goes. With that many InterWiki destinations recognised, we can't expect everyone to be able to recognise the URL.
* RecentChanges can tell you if something is updated, or offer you a view of the diff, but not both at the same time.
* That's what I'm doing for the time being, but by the same rationale you don't need to offer diffs from RecentChanges at all.
* It'd be really nice if the diff was between now and the most recent version saved before your timestamp (or, failing that, the oldest version available). That way, diff is "show me what happened since I was last here", not just "show me what the last edit was."
* Hmmm, that '''is''' so. :) Take a look at the message at the top of the diff page after clicking on "updated", it'll often show text like "spanning x versions". You need the current CVS version for that, though.
* Oh, okay. Is this MoinMoin CVS enabled? Reason being: I did a few updates of a page, and was only being shown the last one. I'll try that some more and get back to you.
With 0.3, TitleIndex is broken if first letter of Japanese WikiName is multibyte character. This patch works well for me but need to be fixed for other charsets.
''Differently broken. :) I think we can live with the current situation, the worst edges are removed (before, chopping the first byte out of an unicode string lead to broken HTML markup!). It will stay that way until I buy the [wiki:ISBN:0201616335 Unicode 3.0] book.''
The main, rectangular background, control and data area of an application. <p></ul>
- MoinMoinDiscussion . . . . 1 match
'''Q''': How do you inline an image stored locally? (e.g. ../wiki-moimoin/data/images/picture.gif)
- MoinMoinNotBugs . . . . 1 match
[[TableOfContents]]
The main, rectangular background, control and data area of an application. <p></ul>
Also worth noting that ''Error: Missing DOCTYPE declaration at start of document'' comes up at the HEAD tag; and ''Error: document type does not allow element "FONT" here'' for a FONT tag that's being used inside a PRE element.
I suspect this problem is pervasive, and I also suspect that the solution is almost moot; probably a one-off counting problem, or a mis-ordered "case" sort of sequence. If the /UL closing tag were to precede the P opening tag, all would be well.
Hey! That ToC thing happening at the top of this page is *really* cool!
''This issue will be resolved in the course of XML formatting -- after all, XML is much more strict than any browser.''
- MoinMoinTodo . . . . 1 match
This is a list of things that are to be implemented. If you miss a feature, have a neat idea or any other suggestion, please put it on MoinMoinIdeas.
To discuss the merit of the planned extensions, or new features from MoinMoinIdeas, please use MoinMoinDiscussion.
A list of things that are added to the current source in CVS are on MoinMoinDone.
MoinMoinRelease describes how to build a release from the SourceForge repository.
Contents: [[TableOfContents]]
* Now that we can identify certain authors (those who have set a user profile), we can avoid to create a backup copy if one author makes several changes; we have to remember who made the last save of a page, though.
* By default, enable an as-if mode that shows what needs to be fixed.
* Replace SystemPages by using the normal "save page" code, thus creating a backup copy of the page that was in the system. Only replace when diff shows the page needs updating.
* [[SiteMap]]: find the hotspots and create a hierarchical list of all pages (again, faster with caching)
* Using the new zipfile module, add a download of all pages
* Some of MeatBall:IndexingScheme as macros
* or look at viewcvs www.lyra.org/viewcvs (a nicer python version of cvsweb with bonsai like features)
* Script or macro to allow the creation of new wikis ==> WikiFarm
* Setup tool (cmd line or cgi): fetch/update from master set of system pages, create a new wiki from the master tarball, delete pages, ...
* Add display of config params (lower/uppercase letterns) to the SystemInfo macro.
* Add a "news item" macro (edit page shows a special form)
* WikiName|s instead of the obsessive WikiName' ' ' ' ' 's (or use " " for escaping)
* Configuration ''outside'' the script proper (config file instead of moin_config.py)
* When a save is in conflict with another update, use the rcs/cvs merge process to create the new page, so the conflicts can be refactored. Warn the user of this!
* Use text links instead of images on RecentChanges
- MoniWikiACL . . . . 1 match
[[TableOfContents]]
* @ALL allow show,ticket,titleindex,bookmark,pagelist
- MoniWikiOptions . . . . 1 match
[[TableOfContents]]
- MoniWikiTutorial . . . . 1 match
* `TableOfContents` - 페이지의 목차를 만들어줍니다.
- MoreEffectiveC++ . . . . 1 match
|| [[TableOfContents]] ||
* Item 5: Be wary of user-defined conversion functions. - 사용자 정의 형변환(conversion) 함수에 주의하라!
* Item 6: Distinguish between prefix and postfix forms of increment and decrement operators. - prefix와 postfix로의 증감 연산자 구분하라!
* Item 8: Understand the differend meanings of new and delete - new와 delete가 쓰임에 따른 의미들의 차이를 이해하라.
* Item 12: Understand how throwing an exception differs from passing a parameter or calling a virtual function [[BR]] - 가상 함수 부르기나, 인자 전달로 처리와 예외전달의 방법의 차이점을 이해하라.
* Item 15: Understand the costs of exception handling. - 예외 핸들링에 대한 비용 지불 대한 이해
* Item 18: Amortize the cose of expected computations. - 예상되는 연산의 값을 계산해 두어라.
* Item 19: Understand the orgin of temporary objects.- 임시 객체들의 기본을 이해하자.
* Item 22: Consider using op= instead of stand-alone op.- 혼자 쓰이는 op(+,-,/) 대신에 op=(+=,-=,/=)을 쓰는걸 생각해 봐라.
* Item 24: Understand the costs of virtual functions, multiple ingeritance, virtual base classes, and RTTI [[BR]] - 가상 함수, 다중 상속, 가상 기초 클래스, RTTI(실시간 형 검사)에 대한 비용을 이해하라
=== Techniques1of2 ===
["MoreEffectiveC++/Techniques1of3"], S or T
* Item 26: Limiting the number of objects of a class - 객체 숫자 제한하기.
=== Techniques2of2 ===
["MoreEffectiveC++/Techniques2of3"], T
=== Techniques2of2 ===
["MoreEffectiveC++/Techniques3of3"], T
* Item 34: Understand how to combine C++ and C in the same program. - 같은 프로그램에서 C++와 C를 혼합하는 법 이해해라.
1. 2002.02.17 Reference Counting 설명 스킬 획득. 이제까지중 가장 방대한 분량이고, 이책의 다른 이름이 '''More Difficult C++''' 라는 것에 100% 공감하게 만든다. Techniques가 너무 길어서 1of2, 2of2 이렇게 둘로 쪼갠다. (세개로 쪼갤지도 모른다.) 처음에는 재미로 시작했는데, 요즘은 식음을 전폐하고, 밥 먹으러가야지. 이제 7개(부록까지) 남았다.
- MoreEffectiveC++/Efficiency . . . . 1 match
||[[TableOfContents]]||
일을 할 그 부분은 실질적으로 당신의 프로그램의 20%로, 당신에게 고민을 안겨주는 부분이다. 그리고 끔찍한 20%를 찾는 방법은 프로그램 프로파일러(profiler:분석자)를 사용하는 것이다. 그렇지만 어떠한 프로파일러(profiler:분석자)도 못할일이다. 당신은 가장 관심 있는 직접적인 해결책을 내놓는 것을 원한다.예를 들자면 당신의 프로그램이 매우 느리다고 하자, 당신은 프로파일러(profiler:분석자)가 프로그램의 각각 다른 부분에서 얼마나 시간이 소비되는지에 관해서 말해줄껄 원한다. 당신이 만약 그러한 능률 관점으로 중요한 향상을 이룰수 있는 부분에 관해 촛점을 맞추는 방법만 알고 있다면 또한 전체 부분에서 효율성을 증대시키는 부분을 말할수있을 것이다.
프로파일러(profiler:분석자)는 각각의 구문이 몇번이나 실행되는가 아니면 각각의 함수들이 몇번이나 불리는거 정도를 알려주는 유틸리티이다. 성능(performance)관점에서 당신은 함수가 몇번 분리는가에 관해서는 그리 큰 관심을 두지 않을 것이다. 프로그램의 사용자 수를 세거나, 너무 많은 구문이 수행되어 불평을 받는 라이브러리를 사용하는 클라이언트의 수를 세거나, 혹은 너무 많은 함수들이 불리는 것을 세는 것은 다소 드문 일이기도 하다. 하지만 만약 당신의 소프트웨어가 충분이 빠르다면 아무도 실행되는 구문의 수에 관해 관여치 않는다. 그리고 만약 너무 느리면 반대겠지. (이후 문장이 너무 이상해서 생략, 바보 작성자)
물론,프로파일러(profiler:분석자)의 장점은 프로세스중 데이터를 잡을수 있다는 점이다. 만약 당신이 당신의 프로그램을 표현되지 않는 입력 값에 대하여 프로파일(감시 정도 의미로)한다고 하면, 프로파일러가 보여준 당신의 소프트웨어의 모습에서 보통의 속도와, 잘 견디는 모습을 보여준다면 - 그부분이 소프트웨어의 80%일꺼다. - 불만있는 구역에는 접근하지 않을 다는 의미가 된다. 프로파일은 오직 당신에게 프로그램의 특별난 부분에 관해서만 이야기 할수 있는걸 기억해라 그래서 만약 당신이 표현되지 않는 입력 데이터 값을 프로파일 한다면 당신은 겉으로 들어나지 않는 값에 대한 프로파일로 돌아가야 할것이다. 그것은 당신이 특별한 쓰임을 위하여 당신의 소프트웨어를 최적화 하는것과 비슷하다. 그리고 이것은 전체를 보는 일반적인 쓰임 아마 부정적인 영양을 줄것이다.
== Item 18: Amortize the cose of expected computations. ==
캐시(cashing)는 예상되는 연산 값을 기록해 놓는 하나의 방법이다. 미리 가지고 오는 것이기도 하다. 당신은 대량의 계산을 줄이는 것과 동등한 효과를 얻을것이라 생각할수 있다. 예를들어서, Disk controller는 프로그래머가 오직 소량의 데이터만을 원함함에도 불구하고 데이터를 얻기위해 디스크를 읽어 나갈때, 전체 블록이나 읽거나, 전체 섹터를 읽는다. 왜냐하면 각기 여러번 하나 두개의 작은 조각으로 읽는것보다 한번 큰 조각의 데이터를 읽는게 더 빠르기 때문이다. 게다가, 이러한 경우는 요구되는 데이터가 한곳에 몰려있다는 걸 보여주고, 이러한 경우가 매우 일반적이라는 것 역시 반증한다. 이 것은 locality of reference (지역 데이터에 대한 참조, 여기서는 데이터를 얻기위해 디스크에 직접 접근하는걸 의미하는듯) 가 좋지 않고, 시스템 엔지니어에게 메모리 케쉬와, 그외의 미리 데이터 가지고 오는 과정을 설명하는 근거가 된다.
over-eager evaluation(선연산,미리연산) 전술은 이 것에대한 답을 제시한다.:만약 우리가 index i로서 현재의 배열상의 크기를 늘리려면, locality of reference 개념은 우리가 아마 곧 index i보다 더 큰 공간의 필요로 한다는걸 이야기 한다. 이런 두번째 (예상되는)확장에 대한 메모리 할당의 비용을 피하기 위해서는 우리는 DynArray의 i의 크기가 요구되는 것에 비해서 조금 더 많은 양을 잡아서 배열의 증가에 예상한다. 그리고 곧 있을 확장에 제공할 영역을 준비해 놓는 것이다. 예를 들어 우리는 DynArray::operator[]를 이렇게 쓸수 있다.
이번 아이템에서의 나의 충고-caching과 prefetching을 통해서 over-eager의 전략으로 예상되는 값들의 미리 계산 시키는것-은 결코 item 17의 lazy evaluation(늦은 계산)과 반대의 개념이 아니다. lazy evaluation의 기술은 당신이 항상 필요하기 않은 어떠한 결과에대한 연산을 반드시 수행해야만 할때 프로그램의 효율성을 높이기 위한 기술이다. over-eager evaluation은 당신이 거의 항상 하는 계산의 결과 값이 필요할때 프로그램의 효율을 높여 줄것이다. 양쪽 모두다 eager evaluation(즉시 계산)의 run-of-the-mill(실행의 비용) 적용에 비해서 사용이 더 어렵다. 그렇지만 둘다 프로그램 많은 노력으로 적용하면 뚜렷한 성능 샹항을 보일수 있다.
== Item 19:Understand the orgin of temporary objects. ==
<< " occurrences of the charcter " << c
== Item 22: Consider using op= instead of stand-alone op. ==
이름이 존재, 비존재 객체와 컴파일러의 최적화에 다한 이야기는 참 흥미롭다. 하지만 커다란 주제를 잊지 말자. 그 커다란 주제는 operator할당 버전과(assignment version of operator, operator+= 따위)이 stand-alone operator적용 버전보다 더 효율적이라는 점이다. 라이브러리 설계자인 당신이 두가지를 모두 제공하고, 어플리케이션 개발자인 당신은 최고의 성능을 위하여 stand-alone operator적용 버전 보다 operator할당 버전(assignment version of operator)의 사용에 대하여 생각해야 할것이다.
속도를 첫번째 초점으로 삼아 보자. iostream과 stdio의 속도를 느낄수 있는 한가지 방법은 각기 두라이브러리를 사용한 어플리케이션의 벤치마크를 해보는 것이다. 자 여기에서 벤치마크에 거짓이 없는 것이 중요하다. 프로그램과 라이브러리 사용에 있어서 만약 당신이 '''일반적인''' 방법으로 사용으로 입력하는 자료(a set of inputs)들을 어렵게 만들지 말아야 하고, 더불이 벤치 마크는 당신과 클라이언트들이 모두 얼마나 '''일반적''' 인가에 대한 신뢰할 방법을 가지고 있지 않다면 이것들은 무용 지물이 된다. 그럼에도 불구하고 벤치 마크는 각기 다른 문제의 접근 방식으로 상반되는 결과를 이끌수 있다. 그래서 벤치마크를 완전히 신뢰하는 것은 멍청한 생각이지만, 이런것들의 완전히 무시하는 것도 멍청한 생각이다.
<< setiosflags(ios::showpoint) // 점 보이도록
<< setiosflags(ios::showpoint)
iostream과 stdio의 이런 상반되는 성능은 단지 예로 촛점은 아니다. 촛점은 비슷한 기능을 제공하는 라이브러리들이 성능과 다른 인자들과의 교환(trade-off)이 이루어 진는 점이다. 그래서 당신은 당신의 프로그램에서 병목현상(bottleneck)을 보일때, 병목 현상을 라이브러리 교체로 해결할 수 있는 경우를 볼수 있다는 점이다. 예를들어서 만약 당신의 프로그램이 I/O병목을 가지고 있다면 당신은 아마 iostream을 stdio로의 교체를 생각해 볼수 있다. 하지만 그것의 시간이 동적 메모리 할당과 해제의 부분이라면 다른 operator new와 opreator delete(Item 8참고)의 교체로 방안을 생각할수 있다. 서로 다른 라이브러리들은 효율성, 확장성, 이동성(이식성), 형안정성, 그리고 다른 주제을 감안해서 서로 다른 디자인의 목적으로 만들어 졌기 때문에 당신은 라이브러리 교체로 눈에 띠게 성능향상의 차이를 느낄수 있을 것이다.
== Item 24: Understand the costs of virtual functions, multiple ingeritance, virtual base classes, and RTTI ==
- MoreEffectiveC++/Miscellany . . . . 1 match
||[[TableOfContents]]||
원문:As software developers, we may not know much, but we do know that things will change. We don't necessarily know what will change, how the changes will be brought about, when the changes will occur, or why they will take place, but we do know this: things will change.
"변화한다.", 험난한 소프트웨어의 발전에 잘 견디는 클래스를 작성하라. (원문:Given that things will change, writeclasses that can withstand the rough-and-tumble world of software evolution.) "demand-paged"의 가상 함수를 피하라. 다른 이가 만들어 놓지 않으면, 너도 만들 방법이 없는 그런 경우를 피하라.(모호, 원문:Avoid "demand-paged" virtual functions, whereby you make no functions virtual unless somebody comes along and demands that you do it) 대신에 함수의 ''meaning''을 결정하고, 유도된 클래스에서 새롭게 정의할 것인지 판단하라. 그렇게 되면, 가상(virtual)으로 선언해라, 어떤 이라도 재정의 못할지라도 말이다. 그렇지 않다면, 비가상(nonvirtual)으로 선언해라, 그리고 차후에 그것을 바꾸어라 왜냐하면 그것은 다른사람을 편하게 하기 때문이다.;전체 클래스의 목적에서 변화를 유지하는지 확신을 해라.
== Item 34: Understand how to combine C++ and C in the same program ==
여기에서 우리가 생각해볼 관점은 총 네가지가 필요하다.:name mangling, initialization of statics, dynamic memory allocation, and data structure compatibility.
=== Initialization of statics : static 인자의 초기화 ===
''The Design and Evolution of C++''에 거의 모든 변화가 언급되어 있다. 현재 C++ 참고서(1994년 이후에 쓰여진것들)도 이 내용을 포함하고 있을 것이다. (만약 당신이 찾지 못하면 그거 버려라) 덧붙여 ''More Effective C++''(이책이다.)는 이러한 새로운 부분에 관한 대부분의 사용 방법이 언급되어 있다. 만약 당신이 이것에 리스트를 알고 싶다면, 이 책의 인덱스를 살펴보아라.
표준 라이브러리에 일어나는 것들에 대한것에서 C++의 정확한 규정의 변화가 있다. 개다가 표준 라이브러리의 개선은 언어의 표준 만큼이나 알려지지 않는다. 예를 들어서 ''The Design and Evolution of C++'' 거의 표준 라이브러리에 관한 언급이 거의 없다. 그 책의 라이브러리에 과한 논의라면 때때로 있는 데이터의 출력이다. 왜냐하면, 라이브러리는 1994년에 실질적으로 변화되었기 때문이다.
Fortunately, this syntactic administrivia is automatically taken care of when you #include the appropriate headers.
STL, 그것의 중심(core)는 매우 간단하다. 그것은 단지, 대표 세트(set of convention)를(일반화 시켰다는 의미) 덧붙인 클래스와 함수 템플릿의 모음이다. STL collection 클래스는 클래스로 정의되어진 형의 iterator 객체 begin과 end 같은 함수를 제공한다. STL algorithm 함수는 STL collection상의 iterator 객체를 이동시킨다. STL iterator는 포인터와 같이 동작한다. 그것은 정말로 모든 것이 포인터 같다. 큰 상속 관계도 없고 가상 함수도 없고 그러한 것들이 없다. 단지 몇개의 클래스와 함수 템플릿과 이들을 위한 작성된 모든 것이다.
- MoreEffectiveC++/Operator . . . . 1 match
||[[TableOfContents]]||
== Item 5: Be wary of user-defined conversion functions. ==
== Item 6: Distinguish between prefix and postfix forms of increment and decrement operators. ==
new delete sizeof typeid
== Item 8: Understand the differend meanings of new and delete ==
이 코드는 new operator를 사용한 것이다. new operator는 sizeof 처럼 언어 상에 포함되어 있으며, 개발자가 더 이상 그 의미의 변경이 불가능하다. 이건 두가지의 역할을 하는데, 첫째로 해당 객체가 들어갈 만한 메모리를 할당하는 것이고, 둘째로 해당 객체의 생성자를 불러주는 역할이다. new operator는 항상 이 두가지의 의미라 작동하며 앞에서 언급한듯 변경은 불가능하다.
void *rawMemory = operator new(sizeof(string));
void *memory = operator new(sizeof(string));
void * buffer = operator new(50*iszeof(char));
void *shareMemory = mallocShared(sizeof(Widget));
- MoreEffectiveC++/Techniques2of3 . . . . 1 match
||[[TableOfContents]]||
// break off a separate copy of the value for ourselves
int showThat() const;
int showThat() const { return value->showThat(); } // delegate시켜 준다.
* '''Relatively few values are shared by relatively many objects.'''
* '''Object values are expensive to create or destroy, or they use lots of memory.'''
가장 확실한 방법은 프로파일(profile)을 통해서 참조세기가 필요한 납득할 만한 이유를 찾는 것이다. 이러한 신뢰가 가는 방법은 성능의 병목 현상이 일어나는 부분에 참조세기의 적용을 통해서 더 높은 효율을 가지고 올수 있다는 증거가 될것이다. 오직 감으로 의존하여, 참조세기의 적용은 역효과를 가져다 올뿐이다.
Software Engineer을 수행하는 입장이라면 물론 이와 같이 CharProxy를 통해서 읽기와 쓰기를 구분해서, 복사에 해당하는 코드를 삭제해야 한다.하지만 이것에 대한 결점을 생각해 보자.
- MoreMFC . . . . 1 match
[[TableOfContents]]
int WINAPI WinMain (HINSTANCE hInstance, HINSTANCE hPrevInstance, LPSTR lpszCmdLine, int nCmdShow)
ShowWindow (hWnd, nCmdShow); // window 보여주기. --;
m_pMainWnd->ShowWindow (m_nCmdShow); //
떡하니 source를 보면 어떻게 돌아가는 거야.. --; 라는 생각이 든다.. 나도 잘모른다. 그런데 가장 중요한것은 global영역에 myApp라는 변수가 선언되어 있다는 사실이다. myApp 라는 instance가 이 프로그램의 instance이다. --a (최초의 프로그램으로 인스턴스화..) 그리고, CWinApp를 상속한 CMyApp에 있는 유일한 함수 initInstance 에서 실제 window를 만들어준다.(InitInstance함수는 응용 프로그램이 처음 생길 때, 곡 window가 생성되기전, 응용 프로그램이 시작한 바로 다음에 호출된다) 이 부분에서 CMainWindow의 instance를 만들어 멤버 변수인 m_pMainWnd로 pointing한다. 이제 window는 생성 되었다. 그렇지만, 기억해야 할 것이 아직 window는 보이지 않는다는 사실이다. 그래서, CMainWindow의 pointer(m_pMainWindow)를 통해서 ShowWindow와 UpdateWindow를 호출해 준다. 그리고 TRUE를 return 함으로써 다음 작업으로 진행 할 수 있게 해준다.... 흘. 영서라 뭔소린지 하나도 모르겠네~ 캬캬.. ''' to be continue..'''[[BR]]
- MySQL . . . . 1 match
|| [[TableOfContents]] ||
- MythicalManMonth . . . . 1 match
MentorOfArts 와 함께 진행중인 ["컴퓨터고전스터디"]의 교재로 이 책을 이용하고 있다.
Any software manager who hasn't read this book should be taken out and shot.
number of software projects that delivered production code.
- NSIS . . . . 1 match
[[TableOfContents]]
nsis 는 free software 이며, 소스가 공개되어있다. 관심있는 사람들은 분석해보시길.
* http://www.nullsoft.com/free/nsis/ - null software 의 nsis 관련 홈페이지.
* http://www.nullsoft.com/free/nsis/makensitemplate.phtml - .nsi code generator
Exec 'regsvr32.exe /s "$INSTDIR\${NAME_OF_MY_DLL}"'
Exec 'regsvr32.exe /s /u "$INSTDIR\${NAME_OF_MY_DLL}"'
DeleteRegKey HKEY_LOCAL_MACHINE "SOFTWARE\${MUI_PRODUCT}"
"SOFTWARE\Microsoft\Windows\CurrentVersion\Uninstall\${MUI_PRODUCT}"
"Software\Microsoft\Windows\CurrentVersion\Uninstall\${MUI_PRODUCT}"
"Software\Microsoft\Windows\CurrentVersion\Uninstall\${MUI_PRODUCT}"
- NSIS/Reference . . . . 1 match
원문 : http://www.nullsoft.com/free/nsis/makensis.htm
[[TableOfContents]]
|| WindowIcon || on | off || Icon 을 표시할 것인지 말것인지 결정 ||
|| || || 기본인자는 off | topcolor bottomcolor captiontextcolor | notext ||
|| DirShow || show || 디렉토리 설정 화면 표시여부 ||
|| ShowInstDetails || show || hide | show | nevershow . install 되는 화면을 보여줄 것인지에 대한 여부 ||
|| DetailsButtonText || "Show Details" || "Show details" 버튼의 text 에 대한 설정 ||
|| ShowUninstDetails || hide | show | nevershow || . ||
|| ExecShell || action command [parameters] [SW_SHOWNORMAL | SW_SHOWMAXIMIZED | SW_SHOWMINIMIZED]|| ShellExecute를 이용, 프로그램을 실행시킨다. action은 보통 'open', 'print' 등을 말한다. $OUTDIR 은 작업디렉토리로 이용된다.||
|| BringToFront || . || . ||
DeleteRegKey HKLM SOFTWARE\myApp
- NSIS/예제3 . . . . 1 match
[[TableOfContents]]
ShowInstDetails show
ShowUninstDetails show
DirShow show
ShowInstDetails show
DetailsButtonText "Show Details"
WriteRegStr HKLM SOFTWARE\ZPTetris "Install_Dir" "$INSTDIR"
WriteRegStr HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\ZPTetris" "DisplayName" "ZPTetris (remove only)"
WriteRegStr HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\ZPTetris" "UninstallString" '"$INSTDIR\uninstall.exe"'
DeleteRegKey HKLM "Software\Microsoft\Windows\CurrentVersion\Uninstall\ZPTetris"
DeleteRegKey HKLM SOFTWARE\ZPTetris
MakeNSIS v1.95 - Copyright 1999-2001 Nullsoft, Inc.
ShowInstDetails: show
ShowUninstDetails: show
DirShow: show
ShowInstDetails: show
DetailsButtonText: "Show Details"
WriteRegStr: HKLM\SOFTWARE\ZPTetris\Install_Dir=$INSTDIR
WriteRegStr: HKLM\Software\Microsoft\Windows\CurrentVersion\Uninstall\ZPTetris\DisplayName=ZPTetris (remove only)
WriteRegStr: HKLM\Software\Microsoft\Windows\CurrentVersion\Uninstall\ZPTetris\UninstallString="$INSTDIR\uninstall.exe"
- NSISIde . . . . 1 match
[[TableOfContents]]
* CFrameWnd::OnClose -> CWndApp::SaveAllModified -> CDocManager::SaveAllModified -> CDocTemplate::SaveAllModified -> CDocument::SaveModified -> CDocument::DoFileSave -> CDocument::DoSave -> CNIDoc::OnSaveDocument
* CDocument::SaveModified -> DoFileSave
- NSIS_Start . . . . 1 match
[[TableOfContents]]
* 프로젝트 이름 : NSIS Start (About Nullsoft ({{{~cpp SuperPiMP}}} | Scriptable) Install System)
* 주제 : Installer Program 에 대한 이해를 위해. free software 인 Nullsoft ({{{~cpp SuperPiMP}}} | Scriptable) Install System 영문메뉴얼을 보면서 한글 메뉴얼을 만든다.
- NUnit/C++예제 . . . . 1 match
[[TableOfContents]]
평소대로 하자면 이렇게 하면 될것이다. 하지만 현재 프로젝트는 [http://msdn.microsoft.com/library/default.asp?url=/library/en-us/vcmxspec/html/vcmanagedextensionsspec_16_2.asp Managed C++ Extensions]이다. 이것은 C++을 이용해서 .Net을 Platform위에서 프로그래밍을 하기 위하여 Microsoft에서 C++을 확장한 형태의 문법을 제안된 추가 문법을 정의해 놓았다. 이를 이용해야 NUnit이 C++ 코드에 접근할수 있다. 이경우 NUnit 에서 검증할 클래스에 접근하기 위해 다음과 같이 클래스 앞에 [http://msdn.microsoft.com/library/default.asp?url=/library/en-us/vcmxspec/html/vcmanagedextensionsspec_16_2.asp __gc] 를 붙여서 선언해야 한다.
__gc의 가 부여하는 능력과 제약 사항에 대해서는 [http://msdn.microsoft.com/library/default.asp?url=/library/en-us/vcmxspec/html/vcmanagedextensionsspec_4.asp __gc] 을 참고하자. NUnit 상에서 테스트의 대상 클래스는 무조건 포인터형으로 접근할수 있다. 이제 테스트 클래스의 내용을 보자.
- NeoZeropageWeb/기획안 . . . . 1 match
[[TableOfContents]]
- OOP . . . . 1 match
[[TableOfContents]]
Object-oriented programming is based in the principle of recursive design.
2. Objects perform computation by making requests of each other through the passing of messages.
3. Every object has it's own memory, which consists of other objects.
4. Every object is an instance of a class. A class groups similar objects.
Program consists of objects interacting with eachother Objects provide services.
- ObjectOrientedDatabaseManagementSystem . . . . 1 match
[[TableOfContents]]
- One/구구단 . . . . 1 match
|| [[TableOfContents]] ||
- One/피라미드 . . . . 1 match
|| [[TableOfContents]] ||
- OpenGL_Beginner . . . . 1 match
[[TableOfContents]]
- OpenGL스터디 . . . . 1 match
[[TableOfContents]]
- OperatingSystemClass/Exam2002_2 . . . . 1 match
* If a memory reference takes 200 nanoseconds, how long does a paged memory reference take?
* If we add associative registers and 75 percent of all page-table references are found in the associative regsters, what is the effective memory time? (Assume that finding a page-table entry in the associative registers takes zero time, if the entry is there)
How many page faults would occur for the following replacement algorithm, assuming one, three, five, seven frames? Remember all frames are initially empty, so your first unique pages will all cost one fault each.
6. Consider a file currently consisting of 100 blocks. Assume that the file control block(and the index block, in the case of indexed allocation) is already in memory, Calculate how many disk I/O operations are required for contiguous, linked and indexed (single-level) allocation strategies, if for one block, the following conditions hold. In the contiguous allocation case, assume that there is no room to grow in the beginning, but there is room to grow in the end. Assume that the block information to be added in stored in memory.
7. Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 143, and the previous requrest was at cylinder 125. The queue of pending requests, in FIFO order, is
Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requrests, for each of the following disk scheduling algorithms?
- PC실관리/고스트 . . . . 1 match
* Microsoft MSDN (2003 이상)
* Microsoft Office - WORD, Excel, PowerPoint
- PC실관리/고스트/네트워크를이용한OS설치 . . . . 1 match
[[TableOfContents]]
- PC실관리프로그램 . . . . 1 match
[[TableOfContents]]
- PHP Programming . . . . 1 match
[[TableOfContents]]
[혜영] Professional PHP Progamming, Jesus Castagnetto 외 4명 공저(김권식 역), 정보문화사 [[BR]]
* 마이티프레스던가 거기서 개정증보판으로 나온 PHP책두 꽤 좋아~ Professional PHP Programming 책은 약간 읽기 답답할 수가 있거든..^^ 음.. 그 책 갖구 있는 넘으로서는 윤군이 있지..
* 저도 객원으로 껴주세요.. 전 다른책을 볼 생각이라서요. 'Beginning PHP 4' 인가? 아무튼 그거도 빨간책인데. 'Professional' 은 아무래도 무리스러워서. 승낙해주시면.. 가끔 문서화에 약간의 도움이라도..; -zennith
- PPProject/20041001FM . . . . 1 match
[[TableOfContents]]
- PairProgramming . . . . 1 match
[[TableOfContents]]
- PairSynchronization . . . . 1 match
[[TableOfContents]]
- ParametricPolymorphism . . . . 1 match
|| [[TableOfContents]] ||
- ParserMarket . . . . 1 match
== Offers ==
||BizarStructuredText: ["parser/stx.py"]||Richard Jones||richard@bizarsoftware.com.au||0.8|| ||
- PatternOrientedSoftwareArchitecture . . . . 1 match
|| [[TableOfContents]] ||
* 시스템의 각 부분은 교환 가능해야 한다. (Design for change in general is a major facilitator of graceful system evolution - 일반적으로 변화에 대비한 디자인을 하는것은 우아한 시스템 개발의 주요한 촉진자이다.)
* 당산의 추상적인 기준에 따라서 추상 레벨들의 갯수를 정하여라. trade-off를 생각해보면서 레이어를 통합하거나 분리해라. 너무 많은 레이어는 프로그램에 과중한 부담이 되고, 너무 적은 레이어는 구조적으로 좋지 않게 된다.
* cascades of changing behavior : 레이어를 바꾸는것뿐만 아니라 그 인터페이스를 바꿀경우에 다른 부분까지 수정해줘야 한다는 말 같다.
* 전문적인 시스템 구조는 application of knowledge에 대해서 단지 하나의 추론 엔진을 제공한다. 다양한 표현에 대한 다양한 부분적인 문제들은 분리된 추론 엔진을 필요로 한다.
* 구조 : 자신의 시스템을 blackboard(knowledge source들의 집합, control components)라고 불리우는 component로 나누어라. blackboard는 중앙 데이터 저장소이다. solution space와 control data들의 요소들이 여기에 저장된다. 하나의 hypothesis는 보통 여러가지 성질이 있다. 그 성질로는 추상 레벨과 추측되는 가설의 사실 정도 또는 그 가설의 시간 간격(걸리는 시간을 말하는거 같다.)이다. 'part-of'또는'in-support of'와 같이 가설들 사이의 관계를 명확이 하는 것은 보통 유용하다. blackboard 는 3차원 문제 공간으로 볼 수도 있다. X축 - time, Y축 - abstraction, Z축 - alternative solution. knowledge source들은 직접적으로 소통을 하지 않는다. 그들은 단지 blackboard에서 읽고 쓸뿐이다. 그러므로 knowledge source 들은 blackboard 의 vocabulary들을 이해해야 한다. 각 knowledge source들은 condition부분과 action부분으로 나눌 수 있다. condition 부분은 knowledge source가 기여를 할수 있는지 결정하기 위해서 blackboard에 적으면서 현재 solution process 의 상태를 계산한다. action 부분은 blackboard의 내용을 바꿀 수 있는 변화를 일으킨다. control component 는 루프를 돌면서 blackboard에 나타나는 변화를 관찰하고 다음에 어떤 action을 취할지 결정한다. blackboard component는 inspect와 update의 두가지 procedure를 가지고 있다.
* control component의 main loof가 시작된다.
partial solution - solution which solve part of the problem
- PatternTemplate . . . . 1 match
[[TableOfContents]]
- PhotoShop2003 . . . . 1 match
[[TableOfContents]]
*If sum of mask_value is '0' or '1' , pixel_values are from '0' to '255' so need not L.U.T.
- Plugin/Chrome/네이버사전 . . . . 1 match
[[TableOfContents]]
// Use of this source code is governed by a BSD-style license that can be
req.onload = showPhotos;
function showPhotos() {
- PowerOfCryptography/Hint . . . . 1 match
[PowerOfCryptography]
- PowerOfCryptography/문보창 . . . . 1 match
// no 113 - Power of Cryptography
[PowerOfCryptography] [LittleAOI]
- PowerOfCryptography/조현태 . . . . 1 match
[PowerOfCryptography] [LittleAOI]
- PragmaticVersionControlWithCVS/CreatingAProject . . . . 1 match
|| [[TableOfContents]] ||
- PragmaticVersionControlWithCVS/UsingModules . . . . 1 match
|| [[TableOfContents]] ||
- PragmaticVersionControlWithCVS/UsingTagsAndBranches . . . . 1 match
|| [[TableOfContents]] ||
- PragmaticVersionControlWithCVS/WhatIsVersionControl . . . . 1 match
|| [[TableOfContents]] ||
- PrivateHomepageMaking . . . . 1 match
[[TableOfContents]]
- Profiling . . . . 1 match
'''Profiling'''(프로파일링)은 원하는 부분의 프로그램 성능을 측정하는 성능 테스트이다.
[[TableOfContents]]
'''Profiling'''(프로파일링)은 원하는 부분의 프로그램 성능을 측정하는 성능 테스트이다.
== Profiling 의 방법 ==
|| C/C++ || [C++Profiling] ||
|| [Java] ||JavaProfiling ||
- ProgrammingContest . . . . 1 match
||[[TableOfContents]]||
http://www.itasoftware.com/careers/programmers.php
- ProgrammingLanguageClass/2006/Report2 . . . . 1 match
[[TableOfContents]]
- ProgrammingLanguageClass/2006/Report3 . . . . 1 match
C supports two kinds of parameter passing mode, pass-by-value and pass-byreference,
though it is difficult to avoid run-time overhead in the execution of thunks, sometimes it
required to prefix the keyword name just in front of both the actual and formal
Of course, if a C program with the call statement above is to be compiled by a
of C.
1) Your program should handle Jensen’s device; show that your program works
3) You have to show off the robustness of your program by checking various
understand what kind of data structures have been used, the characteristics and general
as well as unique features of your program, etc. An internal documentation means the
required to submit a listing of your program and a set of test data of your own choice,
and its output, when you show up for demo. Be sure to design carefully your test data
- ProgrammingPartyPhotos . . . . 1 match
||http://zeropage.org/pds/200252001924/CrcSessionOfZp1.jpg||
- ProgrammingPearls/Column1 . . . . 1 match
[[TableOfContents]]
- ProgrammingPearls/Column3 . . . . 1 match
[[TableOfContents]]
=== 3.3 An Array of Examples ===
- ProgrammingPearls/Column4 . . . . 1 match
[[TableOfContents]]
=== The shallange of binary search ===
=== The Roles of Program Verification ===
- ProgrammingPearls/Column5 . . . . 1 match
[[TableOfContents]]
== A Small Matter of Programming ==
=== The art of assertion ===
- ProgrammingPearls/Column6 . . . . 1 match
[[TableOfContents]]
- ProjectEazy . . . . 1 match
[TheChild'sAcquisitionOfLanguage], [아동언어습득이론] - 아동이 언어를 습득해서 문장을 만드는 과정
- ProjectPrometheus/CookBook . . . . 1 match
[[TableOfContents]]
- ProjectSemiPhotoshop . . . . 1 match
|| [[TableOfContents]] ||
- ProjectSemiPhotoshop/SpikeSolution . . . . 1 match
return (WORD)(::DIBNumColors(lpbi) * sizeof(RGBQUAD));
return (WORD)(::DIBNumColors(lpbi) * sizeof(RGBTRIPLE));
/* If this is a Windows-style DIB, the number of colors in the
* color table can be less than the number of bits per pixel
/* Calculate the number of colors in the color table based on
* the number of bits per pixel for the DIB.
/* return number of colors based on bits per pixel */
if(file.Read((LPSTR)&bmfHeader, sizeof(bmfHeader))!=sizeof(bmfHeader))
if (file.ReadHuge(pDIB, dwBitsSize - sizeof(BITMAPFILEHEADER)) != dwBitsSize - sizeof(BITMAPFILEHEADER) )
DWORD dwBmBitsSize; // Size of Bitmap Bits only
bmfHdr.bfSize = dwDIBSize + sizeof(BITMAPFILEHEADER);
bmfHdr.bfOffBits=(DWORD)sizeof(BITMAPFILEHEADER)+lpBI->biSize + PaletteSize((LPSTR)lpBI);
file.Write((LPSTR)&bmfHdr, sizeof(BITMAPFILEHEADER));
- ProjectZephyrus/Afterwords . . . . 1 match
||[[TableOfContents]]||
- ProjectZephyrus/Client . . . . 1 match
|||||| '''등록한 친구들에 대한 On/Off 상태 표시 - 2 ''' ||
- PyIde . . . . 1 match
[[TableOfContents]]
* http://www.die-offenbachs.de/detlev/eric3.html - 스크린샷만 두고 볼때 가장 잘만들어져보이는 IDE.
- PyUnit . . . . 1 match
[[TableOfContents]]
- Python/DataBase . . . . 1 match
[[TableOfContents]]
res = cur.fetchmany(10)
- PythonIDE . . . . 1 match
* IDLE : 파이선 Official 에서 제공한는 기본 IDE
- PythonNetworkProgramming . . . . 1 match
[[TableOfContents]]
- PythonThreadProgramming . . . . 1 match
[[TableOfContents]]
time.sleep(sleeptime) #sleep for a specified amount of time.
- RAID . . . . 1 match
#redirect RedundantArrayOfInexpensiveDisks
- RSSAndAtomCompared . . . . 1 match
#pragma section-numbers off
|| [[TableOfContents]] ||
People who generate syndication feeds have a choice of
feed formats. As of mid-2005, the two
The purpose of this page is to summarize, as clearly and simply as possible, the differences between the RSS 2.0 and Atom 1.0 syndication languages.
The RSS 2.0 specification is copyrighted by Harvard University and is frozen. No significant changes can be made and it is intended that future work be done under a different name; Atom is one example of such work.
The Atom 1.0 specification (in the course of becoming an
IETF standards track RFC) represents the consensus of the
[http://www.ietf.org/iesg.html Internet Engineering Steering Group]. The specification is structured in such a way that the IETF could conceivably issue further versions or revisions of this specification without breaking existing deployments, although there is no commitment, nor currently expressed interest, in doing so.
See the Extensibility section below for how each can be extended without changing the specifications themselves.
[http://www.bblfish.net/blog/page7.html#2005/06/20/22-28-18-208 reports] of problems with interoperability and feature shortcomings.
The Atompub working group is in the late stages of developing the
RSS 2.0 requires feed-level title, link, and description. RSS 2.0 does not require that any of the fields of individual items in a feed be present.
RSS 2.0 may contain either plain text or escaped HTML, with no way to indicate which of the two is provided. Escaped HTML is ugly (for example, the string AT&T would be expressed as “AT&T”) and has been a source of difficulty for implementors. RSS 2.0 cannot contain actual well-formed XML markup, which reduces the re-usability of content.
Atom has a carefully-designed payload container. Content may be explicitly labeled as any one of:
RSS 2.0 has a “description” element which is commonly used to contain either the full text of an entry or just a synopsis (sometimes in the same feed), and which sometimes is absent. There is no built-in way to signal whether the contents are complete.
[http://diveintomark.org/archives/2002/06/02/important_change_to_the_link_tag autodiscovery] has been implemented several times in different ways and has never been standardized. This is a common source of difficulty for non-technical users.
Atom [http://www.ietf.org/internet-drafts/draft-ietf-atompub-autodiscovery-01.txt standardizes autodiscovery]. Additionally, Atom feeds contain a “self” pointer, so a newsreader can auto-subscribe given only the contents of the feed, based on Web-standard dispatching techniques.
The only recognized form of RSS 2.0 is an <rss> document.
== Differences of Degree ==
- RUR-PLE/Etc . . . . 1 match
[[TableOfContents]]
turn_off()
turn_off()
turn_off()
turn_off()
turn_off()
turn_off()
turn_off()
turn_off()
turn_off()
turn_off()
- RUR-PLE/Maze . . . . 1 match
[[TableOfContents]]
turn_off()
turn_off()
- RUR-PLE/Newspaper . . . . 1 match
[[TableOfContents]]
turn_off()
turn_off()
turn_off()
- RandomWalk2 . . . . 1 match
이런 경험을 하게 되면 "디자인의 질"이 무엇인가 직접 체험하게 되고, 그것에 대해 생각해 보게 되며, 실패/개선을 통해 점차 디자인 실력을 높일 수 있다. 뭔가 잘하기 위해서는, "이런 것이 있고, 난 그것을 잘 못하는구나"하는 "무지의 인식"이 선행되어야 한다. (see also Wiki:FourLevelsOfCompetence )
- RandomWalk2/Insu . . . . 1 match
[[TableOfContents]]
void ShowStatus();
void RandomWalkBoard::ShowStatus()
test.ShowStatus();
void ShowStatus();
void RandomWalkBoard::ShowStatus()
test.ShowStatus();
void ShowStatus() const;
void RandomWalkBoard::ShowStatus() const
test.ShowStatus();
void ShowStatus() const;
void RandomWalkBoard::ShowStatus() const
test.ShowStatus();
void ShowStatus() const;
void RandomWalkBoard::ShowStatus() const
while(!in.eof())
test.ShowStatus();
void ShowStatus() const;
void RandomWalkBoard::ShowStatus() const
while(!in.eof())
- ReadySet 번역처음화면 . . . . 1 match
Software development projects require a lot of "paperwork" in the form of requirements documents, design documents, test plans, schedules, checklists, release notes, etc. It seems that everyone creates the documents from a blank page, from the documents used on their last project, or from one of a handful of high-priced proprietary software engineering template libraries. For those of us who start from a blank page, it can be a lot of work and it is easy to forget important parts. That is not a very reliable basis for professional engineering projects.
'''* What is the goal of this project?'''
ReadySET is an open source project to produce and maintain a library of reusable software engineering document templates. These templates provide a ready starting point for the documents used in software development projects. Using good templates can help developers work more quickly, but they also help to prompt discussion and avoid oversights.
* Templates for many common software engineering documents. Including:
This is an open source project that you are welcome to use for free and help make better. Existing packages of software engineering templates are highly costly and biased by the authorship of only a few people, by vendor-client relationships, or by the set of tools offered by a particular vendor.
The templates are not burdened with information about individual authorship or document change history. It is assumed that professional software developers will keep all project documents in version control systems that provide those capabilities.
These templates are not one-size-fits-all and they do not attempt to provide prescriptive guidance on the overall development process. We are developing a broad library of template modules for many purposes and processes. The templates may be filled out in a suggested sequence or in any sequence that fits your existing process. They may be easily customized with any text or HTML editor.
'''*What is the scope of this project?'''
We will build templates for common software engineering documents inspired by our own exprience.
I assume that the user takes ultimate responsibility for the content of all their actual project documents. The templates are merely starting points and low-level guidance.
This project does not attempt to provide powerful tools for reorganizing the templates, mapping them to a given software development process, or generating templates from a underlying process model. This project does not include any application code for any tools, users simply use text editors to fill in or customize the templates.
'''*Is this project part of a larger effort?'''
Yes. It is part of the Tigris.org mission of promoting open source software engineering. It is also the first product in a product line that will provide even better support to professional software developers. For more information, see [http://www.readysetpro.com ReadySET Pro] .
'''*What is the status of this project?'''
These templates are based on templates originally used to teach software engineering in a university project course. They are now being enhanced, expanded, and used more widely by professionals in industry.
ReadySET is aimed at software engineers who wish that their projects could go more smoothly and professionally. ReadySET can be used by anyone who is able to use an HTML editor or edit HTML in a text editor.
'''*How can users get started?'''
*3. Edit the templates to fit the needs of your project
*Use a text editor or an HTML editor. Please see our list of recommended tools. (You can use Word, but that is strongly discouraged.)
*6. Use the checklists to catch common errors and improve the quality of your documents.
- RedThon . . . . 1 match
{{|Many programmes lose sight of the fact that learning a particular system or language is a means of learning something else, not an goal in itself.
- Refactoring/BigRefactorings . . . . 1 match
[[TableOfContents]]
* You have a class that is doing too much work, at least in part through many conditional statements.[[BR]]''Create a hierarchy of classes in which each subclass represents a special case.''
- Refactoring/DealingWithGeneralization . . . . 1 match
[[TableOfContents]]
* Behavior on a superclass is relevant only for some of its subclasses.[[BR]]''Move it to those subclasses.''
* A class has features that are used only in some instances.[[BR]]''Create a subclass for that subset of features.''
* Several clients use the same subset of a class's interface, or two classes have part of their interfaces in common.[[BR]]''Extract the subset into an interface.''
* A subclass uses only part of a superclasses interface or does not want to inherit data.[[BR]]''Create a field for the superclass, adjust methods to delegate to the superclass, and remove the subclassing.''
* You're using delegation and are ofter writing many simple delegations for the entire interface.[[BR]]''Make the delegating class a subclass of the delegate.''
- Refactoring/MovingFeaturesBetweenObjects . . . . 1 match
[[TableOfContents]]
A method is, or will be, using or used by more features of another class than the class on which it is defined.
A client is calling a delegate class of an object.
''Create a method in the client class with an instance of the server class as its first argument.''
''Create a new class that contains these extra methods. Make the extension class a subclass or a wapper of the original.''
- Refactoring/OrganizingData . . . . 1 match
[[TableOfContents]]
* You have a class with many equal instances that you want to replace with a single object. [[BR]] ''Turn the object into a reference object.''
* You have domain data available only in a GUI control, and domain methods need access. [[BR]] ''Copy the data to a domain object. Set up an observer to synchronize the two pieces of data.''
* You have a two-way associational but one class no longer needs features from the other. [[BR]]''Drop the unneeded end of the association.''
* You have an immutable type code that affects the bahavior of a class. [[BR]] ''Replace the type code with subclasses.''
* You have a type code that affects the behavior of a class, but you cannot use subclassing. [[BR]] ''REplace the type code with a state object.''
- Refactoring/RefactoringReuse,andReality . . . . 1 match
[[TableOfContents]]
=== Reducing the Overhead of Refactoring ===
== Implications Regarding Software Reuse and Technology Transfer ==
- Refactoring/RefactoringTools . . . . 1 match
[[TableOfContents]]
- Refactoring/SimplifyingConditionalExpressions . . . . 1 match
[[TableOfContents]]
* You have a sequence of conditional tests with the same result. [[BR]]''Combine them into a single conditional expression and extract it.''
* The same fragment of code is in all branches of a conditional expression. [[BR]]''Move it outside of the expression.''
* A method has conditional behavior that does not make clear the normal path of execution [[BR]] ''Use guard clauses for all the special cases.''
* You have a conditional that chooses different behavior depending on the type of and object [[BR]] ''Move each leg of the conditional to an overriding method in a subclass. Make the orginal method abstract.''
return getBaseSpeed() - getLoadFactor() * _numberofCoconuts;
* A section of code assumes something about the state of the program. [[BR]]''Make the assumption explicit with an assertion.''
- RegularExpression/2011년스터디 . . . . 1 match
[[TableOfContents]]
<a href ="dfdof></a>
<a href ="dfdof class="dfdfd"></a>
<a href ="dfdof" class=dfdfd" name ="cdef"></a>
- RelationalDatabaseManagementSystem . . . . 1 match
[[TableOfContents]]
The fundamental assumption of the relational model is that all data are represented as mathematical relations, i.e., a subset of the Cartesian product of n sets. In the mathematical model, reasoning about such data is done in two-valued predicate logic (that is, without NULLs), meaning there are two possible evaluations for each proposition: either true or false. Data are operated upon by means of a relational calculus and algebra.
The relational data model permits the designer to create a consistent logical model of information, to be refined through database normalization. The access plans and other implementation and operation details are handled by the DBMS engine, and should not be reflected in the logical model. This contrasts with common practice for SQL DBMSs in which performance tuning often requires changes to the logical model.
The basic relational building block is the domain, or data type. A tuple is an ordered multiset of attributes, which are ordered pairs of domain and value. A relvar (relation variable) is a set of ordered pairs of domain and name, which serves as the header for a relation. A relation is a set of tuples. Although these relational concepts are mathematically defined, they map loosely to traditional database concepts. A table is an accepted visual representation of a relation; a tuple is similar to the concept of row.
The basic principle of the relational model is the Information Principle: all information is represented by data values in relations. Thus, the relvars are not related to each other at design time: rather, designers use the same domain in several relvars, and if one attribute is dependent on another, this dependency is enforced through referential integrity.
에드가 코드는 IBM에서 일할 당시 하드 디스크 시스템의 개발을 하였다. 이 사람은 기존의 codasyl approach 의 navigational 모델에 상당히 불만을 많이 가지고 있었다. 왜냐하면 navigational 모델에서는 테이프 대신에 디스크에 데이터베이스가 저장되면서 급속하게 필요하게된 검색 기능에 대한 고려가 전혀되어있지 않았기 때문이다. 1970년에 들어서면서 이 사람은 데이터베이스 구축에 관한 많은 논문을 썻다. 그 논문은 결국에는 A Relational Model of Data for Large Shared Data Banks 라는 데이터 베이스 이론에 근복적인 접근을 바꾸는 논문으로 집대성되었다.
- ResponsibilityDrivenDesign . . . . 1 match
* Generates DesignPatterns. ChainofResponsibilityPattern, MediatorPattern, CommandPattern and TemplateMethodPattern are all generated by the method.
* SeparationOfConcerns - 논문에 관련 내용이 언급된 바 있음.
* Wirfs-Brock's DesigningObjectOrientedSoftware (["중앙도서관"]에 있음)
- Ruby/2011년스터디 . . . . 1 match
[[TableOfContents]]
- Ruby/2011년스터디/서지혜 . . . . 1 match
[[TableOfContents]]
pe32.dwSize = sizeof(PROCESSENTRY32);
printf("number of process = %d", countProcess);
pe32.dwSize = sizeof(PROCESSENTRY32);
- Ruby/2011년스터디/세미나 . . . . 1 match
[[TableOfContents]]
@var # this is the way how declaring variable
- RubyLanguage/Class . . . . 1 match
[[TableOfContents]]
- RubyLanguage/Container . . . . 1 match
[[TableOfContents]]
coffee = ["아메리카노", "카페모카", "카푸치노"]
coffee[2] #coffee 배열의 세번째 요소인 "카푸치노"에 접근
p coffee[2] #"카푸치노" 출력
coffee[3] #coffee 배열의 네번째 요소에 접근하나 요소가 없으므로 nil 반환
- RubyLanguage/DataType . . . . 1 match
[[TableOfContents]]
- RubyLanguage/ExceptionHandling . . . . 1 match
[[TableOfContents]]
- RubyLanguage/Expression . . . . 1 match
[[TableOfContents]]
- RubyLanguage/InputOutput . . . . 1 match
[[TableOfContents]]
- RubyOnRails . . . . 1 match
[[TableOfContents]]
- RuminationOnC++ . . . . 1 match
{{|[[TableOfContents]]|}}
- RunTimeTypeInformation . . . . 1 match
[[TableOfContents]]
동적으로 만들어진 변수의 타입을 비교하고, 특정 타입으로 생성하는 것을 가능하게 한다. (자바에서는 instanceof를 생각해보면 될 듯)
- SICP . . . . 1 match
#redirect StructureAndInterpretationOfComputerPrograms
- SRPG제작 . . . . 1 match
[[TableOfContents]]
- STL/list . . . . 1 match
|| [[TableOfContents]] ||
- STL/set . . . . 1 match
[[TableOfContents]]
- STL/string . . . . 1 match
|| [[TableOfContents]] ||
- STL/vector . . . . 1 match
[[TableOfContents]]
- STLPort . . . . 1 match
[[TableOfContents]]
1. MSVC 컴파일러의 자질구레한 경고 메시지를 막을 수 있다 ({{{~cpp _msvc_warnings_off.h}}}가 준비되어 있음)
* Tools > Options 메뉴 > Directories 탭에서, Include Files 목록에 방금 추가된 stlport 디렉토리(대개 ''C:/Program Files/Microsoft Visual Studio/VC98/include/stlport''이겠지요)를 추가하고 나서, 이 항목을 가장 첫 줄로 올립니다.
LINK : warning LNK4098: defaultlib "LIBCMT" conflicts with use of other libs; use /NODEFAULTLIB:library
* [http://msdn.microsoft.com/library/kor/default.asp?url=/library/KOR/vccore/html/LNK4098.asp 관련 MSDN 링크]
e:\microsoft visual studio\vc98\include\stlport\stl\_threads.h(122) :
error C2733: second C linkage of overloaded function 'InterlockedIncrement' not allowed
e:\microsoft visual studio\vc98\include\stlport\stl\_threads.h(122) : see declaration of
이 컴파일 에러를 막으려면, STLport가 설치된 디렉토리(대개 C:/Program Files/Microsoft Visual Studio/VC98/include/stlport이겠지요) 에서 stl_user_config.h를 찾아 열고, 다음 부분을 주석 해제합니다.
- SVN . . . . 1 match
[[TableOfContents]]
- SVN/Server . . . . 1 match
[[TableOfContents]]
* [http://www.pyrasis.com/main/Subversion-HOWTO]
- ScaleFreeNetwork/OpenSource . . . . 1 match
[[TableOfContents]]
* Complex Network Metrics and Software Evolvability
- ScheduledWalk/석천 . . . . 1 match
[[TableOfContents]]
- SchemeLanguage . . . . 1 match
* http://www.htdp.org/ - How To Design Programs. 비 전공자들을 위한 Scheme Language 책으로, 인터넷에 공개되어있다. 위의 PLT Scheme 을 인스톨하면 Help 탭에 HTDP 링크가 생긴다.
- Seminar . . . . 1 match
{{|[[TableOfContents]]|}}
- SeminarHowToProgramItAfterwords . . . . 1 match
SeminarHowToProgramIt에 대한 감상, 후기, 각종 질답, 논의, ThreeFs.
- SmallTalk/강좌FromHitel/강의3 . . . . 1 match
* Previous experience of Smalltalk?
* Intended use of this product?
* How many attempts did it take you to download this software?:
- SoJu . . . . 1 match
[[TableOfContents]]
- SoftwareCraftsmanship . . . . 1 match
또 다른 모습의 SoftwareEngineering. ProgrammersAtWork 에서도 인터뷰 중 프로그래머에게 자주 물어보는 질문중 하나인 '소프트웨어개발은 공학입니까? 예술입니까?'. 기존의 거대한 메타포였던 SoftwareEngineering 에 대한 새로운 자리잡아주기. 두가지 요소의 접경지대에서의 대안적 교육방법으로서의 ApprenticeShip.
인터넷이라는 정보의 바다속 시대에서 Offline 모임의 존재가치를 찾을 수 있을것이라는 생각.
* wiki:Wiki:SoftwareCraftsmanship , wiki:Wiki:QuestionsAboutSoftwareCraftsmanshipBook - OriginalWiki 에서의 이야기들.
* wiki:NoSmok:SoftwareCraftsmanship
- SoftwareEngineeringClass/Exam2006_1 . . . . 1 match
[[TableOfContents]]
- SourceCode . . . . 1 match
[[TableOfContents]]
- Spring/탐험스터디 . . . . 1 match
[[TableOfContents]]
- Spring/탐험스터디/2011 . . . . 1 match
[[TableOfContents]]
Ioc로 DaoFactory를 만드는 것까지 했습니다 ㅠㅠ
- Squeak . . . . 1 match
* Squeak: A Quick Trip to ObjectLand
- StacksOfFlapjacks/문보창 . . . . 1 match
// no 120 - Stacks of Flapjacks
void show_stack(int * s, int size);
show_stack(stack, sizeStack);
if (cin.peek() == EOF)
void show_stack(int * s, int size)
[AOI] [StacksOfFlapjacks]
- StacksOfFlapjacks/조현태 . . . . 1 match
[AOI] [StacksOfFlapjacks]
- StringOfCPlusPlus/상협 . . . . 1 match
[[TableOfContents]]
- StringOfCPlusPlus/세연 . . . . 1 match
while(!file.eof())
["StringOfCPlusPlus"]
- Struts . . . . 1 match
'''가다''' ㅇㅇㅇㅇ ---- [페이지명 또는 URL] [(카페명)] [[TableOfContents]] == 제목(2번째크기) == * 목|| 표-칸1 || 칸2||
- SubVersion . . . . 1 match
[[TableOfContents]]
http://www.pyrasis.com/main/Subversion-HOWTO
- SummationOfFourPrimes/김회영 . . . . 1 match
[SummationOfFourPrimes]
- SystemEngineeringTeam . . . . 1 match
* System Engineering Team of ZeroPage
* mail account in [:domains.live.com/ Microsoft Live Domains]
* Offline Kick off
- TAOCP/BasicConcepts . . . . 1 match
[[TableOfContents]]
== 1.3.1. Description of MIX ==
* Words( Partitial fieslds of words포함)
Overfolw toggle - on, off
F - 명령어의 변경(a modification of the operation code). (L:R)이라면 8L+R = F
MIX 프로그램의 예제를 보여준다. 중요한 순열의 성질(properties of permutations)을 소개한다.
=== Products of permutations ===
- TAOCP/Exercises . . . . 1 match
[[TableOfContents]]
- TCP/IP 네트워크 관리 . . . . 1 match
[[TableOfContents]]
- TCP/IP 네트워크 관리 / TCP/IP의 개요 . . . . 1 match
[[TableOfContents]]
- TCP/IP_IllustratedVol1 . . . . 1 match
[[TableOfContents]]
- TFP예제/Omok . . . . 1 match
[[TableOfContents]]
- TeachYourselfProgrammingInTenYears . . . . 1 match
[[TableOfContents]]
- Technorati . . . . 1 match
{{| [[TableOfContents]] |}}
- TestDrivenDevelopment . . . . 1 match
[[TableOfContents]]
- TestDrivenDevelopmentByExample . . . . 1 match
개인적으로 TDD 중 빠른 테스트 통과를 위해 가짜 상수로 쌓아나갈때 어떻게 '중복' 이라 하여 ["Refactoring"] 할까 고민했었는데, 이전의 SeminarHowToProgramIt 에서의 예제 이후 이 문서에서의 예제가 깔끔하게 풀어주네요. 인제 한번 들여다 본 중이긴 하지만, 저자가 저자인 만큼 (KentBeck).~
- TheJavaMan/스네이크바이트 . . . . 1 match
// bo.l1.setText("점수 : " + String.valueOf(v.size()));
JOptionPane.showMessageDialog(null, "죽었습니다.");
JOptionPane.showInputDialog("Enter your name please");
- TheKnightsOfTheRoundTable/문보창 . . . . 1 match
// 10195 - The Knights of the Round Table
printf("The radius of the round table is: %.3f\n", r);
[TheKnightsOfTheRoundTable]
- TheKnightsOfTheRoundTable/허준수 . . . . 1 match
cout << "The radius of the round table is: 0.000" <<endl;
cout << "The radius of the round table is: "
cout.setf(ios::showpoint);
[TheKnightsOfTheRoundTable]
- ThePracticeOfProgramming . . . . 1 match
[TheElementsOfProgrammingStyle] 에 대해 문의사항이 있어 저자중 한명에게 메일을 보냈더니, 이 책을 언급하였다. TEOPS 의 중요한 내용들을 이책의 첫 챕터에 수록하였다는 말과 함께. -_-a
- TheWarOfGenesis2R/ToDo . . . . 1 match
[TheWarOfGenesis2R]
- TheWarOfGenesis2R/일지 . . . . 1 match
[TheWarOfGenesis2R]
- TkinterProgramming . . . . 1 match
[[TableOfContents]]
- TkinterProgramming/Calculator2 . . . . 1 match
'store' : self.doThis, 'off' : self.turnoff,
def turnoff(self, *args):
[ ('Off', '', '', KC1, FUN, 'off'),
- TopicMap . . . . 1 match
TopicMap''''''s are pages that contain markup similar to ['''include'''] (maybe ['''refer'''] or ['''toc''']), but the normal page layout and the ''print layout'' differ: expansion of the includes only happens in the print view. The net result is that one can extract nice papers from a Wiki, without breaking its hyper-linked nature.
''Nice idea. But i would just make it the normal behavior for external links. That way you don't clutter MoinMoin with too many different features. --MarkoSchulz''
I plan to use [ ] with a consistent syntax for such things. How do you mean the external link thing? Including other web pages, or "only" other Wiki pages?
OK, for the simple stuff (i.e. local links), how about this:
This is useable for navigation in the '''normal''' view. Now imagine that if this is marked as a TopicMap, the ''content'' of the WikiName''''''s that appear is included ''after'' this table of contents, in the '''print''' view.
- Trac . . . . 1 match
{{| [[TableOfContents]] |}}
Trac is an enhanced wiki and issue tracking system for software development projects. Trac uses a minimalistic approach to web-based software project management. Our mission; to help developers write great software while staying out of the way. Trac should impose as little as possible on a team's established development process and policies.
Trac allows wiki markup in issue descriptions and commit messages, creating links and seamless references between bugs, tasks, changesets, files and wiki pages. A timeline shows all project events in order, making getting an overview of the project and tracking progress very easy.
- TugOfWar/강희경 . . . . 1 match
[TugOfWar] [AOI]
- TugOfWar/문보창 . . . . 1 match
// no10032 - Tug of War
qsort(weight, nPeople, sizeof(int), comp);
[TugOfWar] [문보창]
- TugOfWar/신재동 . . . . 1 match
=== TugOfWar/신재동 ===
- TugOfWar/이승한 . . . . 1 match
= TugOfWar/[이승한] =
- Ubiquitous . . . . 1 match
[[TableOfContents]]
QoS(Quality of Service) : QoS 이상의 의미는 없는 듯.
- UnixSocketProgrammingAndWindowsImplementation . . . . 1 match
[[TableOfContents]]
memset((struct sockaddr *)&ina, 0, sizeof(struct sockaddr));
if( bind(sockfd, (struct sockaddr *)&ina, sizeof(struct sockaddr) == -1 )
int sizeof_sockaddr_in;
sizeof_sockaddr_in = sizeof(struct sockaddr_in);
client_sock = accept(server_sock, (struct sockaddr *)&client_addr, &sizeof_sockaddr_in);
if( connect(client_sock, (struct sockaddr *)&client_addr, sizeof(struct sockaddr)) == -1 )
if( send(client_sock, buf1, sizeof(buf), 0) == -1 )
// 성공 시 수신 한 바이트 수(단 EOF만나면 0), 실패 시 -1 리턴
str_len = recv(sockfd, buf1, sizeof(buf1), 0);
str_len = read(sockfd, buf2, sizeof(buf2));
int sizeof_sockaddr_in;
memset((SOCKADDR_IN *)&server_addr, 0, sizeof(SOCKADDR_IN));
if( bind(server_sock, (sockaddr *)&server_addr, sizeof(SOCKADDR_IN)) == -1 )
sizeof_sockaddr_in = sizeof(SOCKADDR_IN);
client_sock = accept(server_sock, (sockaddr *)&client_addr, &sizeof_sockaddr_in);
send(client_sock, msg, sizeof(msg), 0);
Socket Programming in Python : [http://www.amk.ca/python/howto/sockets/]
- UpgradeC++/과제1 . . . . 1 match
|| [[TableOfContents]] ||
- UploadFile . . . . 1 match
[[TableOfContents]]
- VMWare . . . . 1 match
[[TableOfContents]]
- VMWare/OSImplementationTest . . . . 1 match
[[TableOfContents]]
[http://neri.cafe24.com/menu/bbs/view.php?id=kb&page=1&sn1=&divpage=1&sn=off&ss=on&sc=on&keyword=x86&select_arrange=headnum&desc=asc&no=264 출처보기]
mov al, 3h ; Number of sectors to read = 1
mov eax, cr0 ; Copy the contents of CR0 into EAX
mov cr0, eax ; Copy the contents of EAX into CR0
jmp 08h:clear_pipe ; Jump to code segment, offset clear_pipe
gdt_end: ; Used to calculate the size of the GDT
dd gdt ; Address of the GDT
number of parameters.\n\n");
== 512 && !feof(input)) {
- VMWare/UsefulFunctions . . . . 1 match
[[TableOfContents]]
- VendingMachine/세연/1002 . . . . 1 match
[[TableOfContents]]
char drinkNames[TOTAL_DRINK_TYPE][DRINKNAME_MAXLENGTH] = {"coke", "juice", "tea", "cofee", "milk"};
char drinkNames[TOTAL_DRINK_TYPE][DRINKNAME_MAXLENGTH] = {"coke", "juice", "tea", "cofee", "milk"};
char drinkNames[TOTAL_DRINK_TYPE][DRINKNAME_MAXLENGTH] = {"coke", "juice", "tea", "cofee", "milk"};
string drinkNames[] = {"coke", "juice", "tea", "cofee", "milk"};
- ViImproved . . . . 1 match
[[TableOfContents]]
- VisualBasicClass . . . . 1 match
VB가 Office 통합이 잘되다보니... 일반인들도 많이들 배우는 편임.
- VisualStuioDotNetHotKey . . . . 1 match
[[TableOfContents]]
- WebGL . . . . 1 match
[[TableOfContents]]
//vertex is coord of points
//index is triangle point index of suface
http://greggman.github.io/webgl-fundamentals/webgl/lessons/webgl-how-it-works.html
- WikiTextFormattingTestPage . . . . 1 match
This page originated on Wiki:WardsWiki, and the most up-to-date copy resides there. This page has been copied here in order to make a quick visual determination of which TextFormattingRules work for this wiki. Currently it primarily determines how text formatted using the original Wiki:WardsWiki text formatting rules is displayed. See http://www.c2.com/cgi/wiki?WikiOriginalTextFormattingRules.
If you want to see how this text appears in the original Wiki:WardsWiki, see http://www.c2.com/cgi/wiki?WikiEngineReviewTextFormattingTest
* CLUG Wiki (older version of WardsWiki, modified by JimWeirich) -- http://www.clug.org/cgi/wiki.cgi?WikiEngineReviewTextFormattingTest
The next line (4 dashes) should show up as a horizontal rule. In a few wikis, the width of the rule is controlled by the number of dashes. That will be tested in a later section of this test page.
'This text, enclosed within in 1 set of single quotes, should appear as normal text surrounded by 1 set of single quotes.'
''This text, enclosed within in 2 sets of single quotes, should appear in italics.''
'''This text, enclosed within in 3 sets of single quotes, should appear in bold face type.'''
''''This text, enclosed within in 4 sets of single quotes, should appear in bold face type surrounded by 1 set of single quotes.''''
'''''This text, enclosed within in 5 sets of single quotes, should appear in bold face italics.'''''
''''''This text, enclosed within in 6 sets of single quotes, should appear as normal text.''''''
'This text, enclosed within in 1 set of single quotes and preceded by one or more spaces, should appear as monospaced text surrounded by 1 set of single quotes.'
''This text, enclosed within in 2 sets of single quotes and preceded by one or more spaces, should appear in monospaced italics.''
'''This text, enclosed within in 3 sets of single quotes and preceded by one or more spaces, should appear in monospaced bold face type.'''
''''This text, enclosed within in 4 sets of single quotes and preceded by one or more spaces, should appear in monospaced bold face type surrounded by 1 set of single quotes.''''
'''''This text, enclosed within in 5 sets of single quotes and preceded by one or more spaces, should appear in monospaced bold face italics.'''''
''''''This text, enclosed within in 6 sets of single quotes and preceded by one or more spaces, should appear as monospaced normal text.''''''
Note that the logic seems to be easily confused. In the next paragraph I combine the two sentences (with no other changes). Notice the results. (The portion between the "innermost" set of triple quotes, and nothing else, is bold.)
Aside: I wonder if any wikis provide multilevel numbering -- I know that Wiki:MicrosoftWord, even back to the Dos 3.0 version, can number an outline with multiple digits, in "legal" or "outline" style numbering. I forget which is which -- one is like 2.1.2.4, the other is like II.A.3.c., and I think there is another one that includes ii.
Wiki: A very strange wonderland. (Formatted as <tab>Wiki:<tab>A very strange wonderland.)
Wiki: A very strange wonderland.
- WinAPI/2011년스터디 . . . . 1 match
[[TableOfContents]]
- WinCVS . . . . 1 match
[[TableOfContents]]
''DeleteMe 맞는 이야기인가요? ["sun"]의 기억으로는 아닌것으로 알고 있고, 홈페이지의 설명에서도 다음과 같이 나와있습니다. 'WinCvs is written using the Microsoft MFC.' '' [[BR]]
- WordPress . . . . 1 match
[[TableOfContents]]
- WorldCup/송지원 . . . . 1 match
[[TableOfContents]]
- X . . . . 1 match
[[TableOfContents]]
== Profile ==
- XMLStudy_2002 . . . . 1 match
[[TableOfContents]]
- XMLStudy_2002/Resource . . . . 1 match
[[TableOfContents]]
*microsoft.public.xml
*microsoft.public.biztalkserver.xmltools
*XML Software의 XML Editor 페이지 : [http://xmlsoftware.com/editors/]
*Robin Cover's XML Software : [http://www.oasis-open.org/cover/xml.html#xmlSoftware]
*XML Software의 XML Parsers/Processors 홈페이지 : XML 파서와 파싱 및 DOM이나 SAX를 지원하는 XML 프로세서에 대한 간단한 설명과 라이센스 상태와 다운로드 받을수 있거나 또는 해당 프로세서의 메인 페이지로 이동할 수 있는 링크를 포함 하고 있다. 수십개 이상의 프로세서에 대한 정보가 있어 거의 모든 파서를 찾을 수 있다. [http://www.xmlsoftware.com/parsers/]
*첫번째 : 다운로드 페이지로 이동 [http://msdn.microsoft.com/xml/general/xmlparser.asp] 안되면 MSDN 다운로드 페이지에서 다운받는다.
- XMLStudy_2002/Start . . . . 1 match
[[TableOfContents]]
<!ATTLIST MAIL STATUS (official|informal) 'official'>
<!ATTLIST ADDRESS TYPE (office|home|e-mail) 'e-mail'>
<ADDRESS TYPE="office">대전 유성구 만년동 111번지</ADDRESS>
5. PHONENUMBER 엘리먼트에 OFFICE 또는 HOME 또는 MOBILE 엘리먼트 중에서 하나가 위치하거나 또는 오지 않는 예
<!ELEMENT PHONENUMBER (OFFICE|HOME|MOBILE)?>
- XMLStudy_2002/XSL . . . . 1 match
[[TableOfContents]]
- Xen . . . . 1 match
[[TableOfContents]]
- XpWeek . . . . 1 match
[[TableOfContents]]
- XpWeek/준비물 . . . . 1 match
* HowToStudyExtremeProgramming
- Z&D토론백업 . . . . 1 match
[[TableOfContents]]
* 상당히 민감한 문제로 가칭(제로페이지데블스)로 정함. 올해 선배님들의 자리를 갖고 선배님들의 의견을 듣고 결정. (이것은 언제 할 것인지? offline ? online?)
- ZIM/EssentialUseCase . . . . 1 match
[[TableOfContents]]
ShowMeTheExample~
- ZPBoard/PHPStudy . . . . 1 match
[[TableOfContents]]
- ZPBoard/PHPStudy/MySQL . . . . 1 match
[[TableOfContents]]
- ZPBoard/PHPStudy/기본문법 . . . . 1 match
[[TableOfContents]]
- ZPBoard/PHPStudy/쿠키 . . . . 1 match
[[TableOfContents]]
- ZP도서관/2013 . . . . 1 match
[[TableOfContents]]
- Zedroid . . . . 1 match
[[TableOfContents]]
- ZeroPage/임원 . . . . 1 match
[[TableOfContents]]
- ZeroPage/임원/회의/2011-01-19 . . . . 1 match
[[TableOfContents]]
- ZeroPage/임원/회의/2011-02-13 . . . . 1 match
[[TableOfContents]]
- ZeroPage/회비 . . . . 1 match
[[TableOfContents]]
- ZeroPageServer . . . . 1 match
[[TableOfContents]]
- ZeroPageServer/AboutCracking . . . . 1 match
|| [[TableOfContents]] ||
- ZeroPage_200_OK . . . . 1 match
[[TableOfContents]]
* MSDN - http://msdn.microsoft.com/ko-kr/
* Microsoft Visual Studio (AJAX.NET -> jQuery)
- ZeroPage_200_OK/note . . . . 1 match
[[TableOfContents]]
if (("f" in _proto) && typeof _proto["f"] === "function")
- ZeroPage_200_OK/소스 . . . . 1 match
[[TableOfContents]]
- ZeroPage성년식/준비 . . . . 1 match
[[TableOfContents]]
- ZeroPage성년식/회의 . . . . 1 match
[[TableOfContents]]
* onoffmix.com에 페이지 만들게요~
* ONOFFMIX에 등록. [http://onoffmix.com/event/4096 ZeroPage성년식]
* 다시 독촉,, 연락 되시고 참여하신다는 분에 한에 onoffmix에 신청 유도
- ZeroPage정학회만들기 . . . . 1 match
[[TableOfContents]]
* 마소, 프세등의 국내잡지나 IeeeSoftware, CACM 등 외국잡지 등 잡지순례 진행 (사람들의 참여도는 꼭 필수적이진 않음. 관심이 있는 사람도 있겠고 없는 사람도 있겠으니까. 우리가 자료들을 준비하고, 외부에 홍보하는 정도로도 역할은 충분하리라 생각)
- ZeroPage정학회만들기/지도교수님여론조사 . . . . 1 match
[[TableOfContents]]
- ZeroPage회칙 . . . . 1 match
[[TableOfContents]]
- ZeroWikiHotKey . . . . 1 match
[[TableOfContents]]
- [Lovely]boy^_^/Arcanoid . . . . 1 match
|| [[TableOfContents]] ||
* I change a background picture from a Jang na ra picture to a blue sky picture. but my calculation of coordinate mistake cuts tree picture.
* My previous arcanoid could process 1ms of multi media timer, but this version of arcanoid can't process over 5ms of multi media timer. why..
* Game can exhibit score, number of broken blocks, and time.
* When a ball collides with a moving bar, its angle changes, but it's crude. Maybe it is hard that maintains a speed of a ball.
* I resolve a problem of multi media timer(10/16). its problem is a size of a object. if its size is bigger than some size, its translation takes long time. So I reduce a size of a object to 1/4, and game can process 1ms of multi media timer.
* Now sources become very dirty, because I add a new game skill. I always try to eliminate a duplication, and my source has few duplication. but method's length is so long, and responsiblity of classes is not divided appropriately. All collision routine is focusing on CArcaBall class.
* I change a design of a arcanoid. - previous version is distribute, but this version is that god class(CArcanoidDoc)' admins a total routine. in my opinion, it's more far from OOP.--;
- [Lovely]boy^_^/Cartoon . . . . 1 match
[[TableOfContents]]
- [Lovely]boy^_^/Diary/2-2-1 . . . . 1 match
* ["EffectiveSTL"], HowToSolveIt(["신재동"]군이 꼬심) 빌림.
- [Lovely]boy^_^/Diary/2-2-10 . . . . 1 match
[[TableOfContents]]
* Today's XB is full of mistakes.--; Because Java Date class's member starts with 0, not 1. so our tests fail and fail and fail again.. So we search some classes that realted with date.- Calendar, GregoryDate, SimpleDate.. - but--; our solution ends at date class. Out remain task is maybe a UI.
- [Lovely]boy^_^/Diary/2-2-12 . . . . 1 match
[[TableOfContents]]
- [Lovely]boy^_^/Diary/2-2-14 . . . . 1 match
[[TableOfContents]]
- [Lovely]boy^_^/Diary/2-2-15 . . . . 1 match
[[TableOfContents]]
* A data communication course ended. Professor told us good sayings. I feel a lot of things about his sayings.
* A merriage and family course ended too, Professor is so funny. A final test is 50 question - O/X and objective.
* A algorithm course ended. This course does not teaches me many things.
* A object programming course ended. Professor told us good sayings, similar to a data communication course's professor. At first, I didn't like him, but now it's not. I like him very much. He is a good man.
* sources for Unix system programming's final-test is so strange.--; mis-typings are so many. I am confused professor's intention.
* I worry about father's smoking... after my mom was hospitalization, he decreases amount of drinking, but increases amount of smoking.
- [Lovely]boy^_^/Diary/2-2-16 . . . . 1 match
[[TableOfContents]]
DeleteMe) I envy you. In my case, all final-exams will end at Friday. Shit~!!! -_- Because of dynamics(In fact, statics)... -_-;; --["Wiz"]
* It's 1st day of a winter school vacation. I must do a plan.
* I read a novel named the Brain all day. Today's reading amount is about 600 pages. It's not so interesting as much as the price of fame.
- [Lovely]boy^_^/Diary/2-2-3 . . . . 1 match
|| [[TableOfContents]] ||
- [Lovely]boy^_^/Diary/2-2-4 . . . . 1 match
|| [[TableOfContents]] ||
- [Lovely]boy^_^/Diary/2-2-5 . . . . 1 match
[[TableOfContents]]
- [Lovely]boy^_^/Diary/2-2-6 . . . . 1 match
[[TableOfContents]]
- [Lovely]boy^_^/Diary/2-2-7 . . . . 1 match
[[TableOfContents]]
- [Lovely]boy^_^/Diary/2-2-8 . . . . 1 match
[[TableOfContents]]
- [Lovely]boy^_^/Diary/7/15_21 . . . . 1 match
[[TableOfContents]]
- [Lovely]boy^_^/Diary/7/22_26 . . . . 1 match
[[TableOfContents]]
- [Lovely]boy^_^/Diary/7/29_8/3 . . . . 1 match
[[TableOfContents]]
- [Lovely]boy^_^/Diary/7/8_14 . . . . 1 match
[[TableOfContents]]
- [Lovely]boy^_^/Diary/8/11_8/17 . . . . 1 match
[[TableOfContents]]
- [Lovely]boy^_^/Diary/8/6_8/10 . . . . 1 match
[[TableOfContents]]
- [Lovely]boy^_^/EnglishGrammer . . . . 1 match
[[TableOfContents]]
- [Lovely]boy^_^/EnglishGrammer/ReportedSpeech . . . . 1 match
[[TableOfContents]]
A. You want to tell somebody else what Tom said. There are two ways of doing this :
B. When we use reported speech, the main verb of the sentence is usually past. The rest of the sentence is usually past, too :
- [NewSSack]Template$ . . . . 1 match
[[TableOfContents]]
- celfin . . . . 1 match
[[TableOfContents]]
- cheal7272 . . . . 1 match
[[TableOfContents]]
- ddori . . . . 1 match
[[TableOfContents]]
- django . . . . 1 match
[[TableOfContents]]
* [http://linux.softpedia.com/progDownload/PySQLite-Download-6511.html pysqlite다운로드]
http://thinkhole.org/wp/2006/04/03/django-on-windows-howto/
* [http://www2.jeffcroft.com/2006/feb/25/django-templates-the-power-of-inheritance/] : Template HTML 파일 사용법
* [http://www.b-list.org/weblog/2006/06/13/how-django-processes-request] : Template 에서의 변수 참조에 대한 설명. 필수!!, 리스트나, 맵, 함수등에 접근하는 방법
- eXtensibleMarkupLanguage . . . . 1 match
The Extensible Markup Language (XML) is a W3C-recommended general-purpose markup language for creating special-purpose markup languages, capable of describing many different kinds of data. In other words XML is a way of describing data and an XML file can contain the data too, as in a database. It is a simplified subset of Standard Generalized Markup Language (SGML). Its primary purpose is to facilitate the sharing of data across different systems, particularly systems connected via the Internet. Languages based on XML (for example, Geography Markup Language (GML), RDF/XML, RSS, Atom, MathML, XHTML, SVG, and MusicXML) are defined in a formal way, allowing programs to modify and validate documents in these languages without prior knowledge of their form.
= Type Of Parser =
* [http://xml.80port.net/bbs/view.php?id=xml&page=2&sn1=&divpage=1&sn=off&ss=on&sc=on&select_arrange=headnum&desc=asc&no=26 VC++에서 msxml 사용]
* [http://www.microsoft.com/downloads/details.aspx?FamilyID=993c0bcf-3bcf-4009-be21-27e85e1857b1&DisplayLang=en MSXML SDK DOWNLOADS]
- eclipse단축키 . . . . 1 match
[[TableOfContents]]
* Content Assist : show template proposals 사용가능한 메소드 이름 보여준다
- eclipse디버깅 . . . . 1 match
[[TableOfContents]]
- erunc0 . . . . 1 match
[[TableOfContents]]
- erunc0/COM . . . . 1 match
[[TableOfContents]]
- erunc0/Java . . . . 1 match
[[TableOfContents]]
- erunc0/PhysicsForGameDevelopment . . . . 1 match
[[TableOfContents]]
- erunc0/RoboCode . . . . 1 match
[[TableOfContents]]
- erunc0/XP . . . . 1 match
[[TableOfContents]]
- geniumin . . . . 1 match
[[TableOfContents]]
== Conceptual Model of Geniumin.. ==
== Special Ability of Geniumin.. ==
- gester . . . . 1 match
[[TableOfContents]]
== Profile ==
- html5/VA . . . . 1 match
[[TableOfContents]]
- html5/drag-and-drop . . . . 1 match
[[TableOfContents]]
- html5/geolocation . . . . 1 match
[[TableOfContents]]
- html5/offline-web-application . . . . 1 match
[[TableOfContents]]
- html5/others-api . . . . 1 match
[[TableOfContents]]
- html5/video&audio . . . . 1 match
[[TableOfContents]]
- html5/web-storage . . . . 1 match
[[TableOfContents]]
- i++VS++i . . . . 1 match
* 사용한 컴파일러 : Microsoft 32-bit C/C++ Optimizing Compiler Version 12.00.8804 for 80x86 (Microsoft Visual C++ 6.0 에 Service Pack 5 를 설치했을때의 컴파일러)
[[TableOfContents]]
push OFFSET FLAT:$SG528
push OFFSET FLAT:$SG528
push OFFSET FLAT:??_C@_02MECO@?$CFd?$AA@
push OFFSET FLAT:??_C@_02MECO@?$CFd?$AA@
- iruril . . . . 1 match
||[[TableOfContents]]||
== Profile ==
- jeppy . . . . 1 match
[[TableOfContents]]
- kairen . . . . 1 match
[[TableOfContents]]
- mantis . . . . 1 match
[[TableOfContents]]
- naneunji . . . . 1 match
[[TableOfContents]]
== Profile ==
- naneunji/Diary . . . . 1 match
[[TableOfContents]]
- nautes . . . . 1 match
[[TableOfContents]]
- neocoin/Education . . . . 1 match
잘 가르치기 위해서는 기본적인 교육학 이론보다는 Cognitive Psychology(학습부분)와 실제 "훌륭한 교사"들의 방법을 설명한 책(예컨대 NoSmok:SuccessfulCollegeTeaching ), 그리고 학습 과정을 설명한 책(NoSmok:HowPeopleLearn )이 좋을 것이다. 또 성인 교육에 있어서는 Training, Coaching 관련 서적이 많은 도움이 된다. --JuNe
- neocoin/MilestoneOfReport . . . . 1 match
[[TableOfContents]]
* 실행 방법,과정 (Process of Executing)
- neocoin/Read/5-6 . . . . 1 match
||[[TableOfContents]]||
- phoenix_insky . . . . 1 match
[[TableOfContents]]
- pinple . . . . 1 match
[[TableOfContents]]
- ricoder . . . . 1 match
[[TableOfContents]]
- setsuna . . . . 1 match
[[TableOfContents]]
- snowflower/Arkanoid . . . . 1 match
[[TableOfContents]]
- ssulsamo . . . . 1 match
[[TableOfContents]]
== Profile ==
- tempOCU . . . . 1 match
[[TableOfContents]]
- uCOS-II . . . . 1 match
[[TableOfContents]]
- warbler . . . . 1 match
[[TableOfContents]]
=== part of identity ===
- wiz네처음화면 . . . . 1 match
= How to contact? =
* http://blog.empas.com/tobfreeman/13965830 , http://knowhow.interpark.com/shoptalk/qna/qnaContent.do?seq=96903
- woodpage . . . . 1 match
[[TableOfContents]]
- woodpage/VisualC++HotKeyTip . . . . 1 match
[[TableOfContents]]
- woodpage/쓰레기 . . . . 1 match
[[TableOfContents]]
- zennith/SICP . . . . 1 match
DeleteMe [SICP] 가 Hierarchical Wiki 로 걸려버려서 원래 의도인 StructureAndInterpretationOfComputerPrograms 의 약자인 [SICP]에 대해서 링크가 걸리질 않음.
- zyint . . . . 1 match
[[TableOfContents]]
- 갓헌내기C,C++스터디 . . . . 1 match
[[TableOfContents]]
- 강성현 . . . . 1 match
[[TableOfContents]]
- 강희경 . . . . 1 match
[[TableOfContents]]
== Profile ==
*[http://aragorn.bawi.org/interests/tao_of_programming_(korean).html]프로그램의 도
*[http://aragorn.bawi.org/interests/tao_of_programming_(english).html]
- 강희경/그림판 . . . . 1 match
[[TableOfContents]]
- 같은 페이지가 생기면 무슨 문제가 있을까? . . . . 1 match
무엇(What-손이 한 번 이라도 덜 가는 구조)인지는 알고, 이것은 저도 전제로 삼는 지향점 입니다. 이야기 할 발전적인 방향은 어떻게(How-그 구조로 어떻게 만들까?)를 논하는 것 이라 생각합니다. 제가 너무 함축적으로 글을 작성해서 풀어 씁니다.
- 객체지향분석설계 . . . . 1 match
[[TableOfContents]]
- 검색에이전시_temp . . . . 1 match
[[TableOfContents]]
- 경세준 . . . . 1 match
[[TableOfContents]]
- 경태 . . . . 1 match
|| [[TableOfContents]] ||
- 고한종 . . . . 1 match
[[TableOfContents]]
- 고한종/업적/WinAPI로만든학과주점포스기 . . . . 1 match
[[TableOfContents]]
- 공개선언 . . . . 1 match
자연어처리를 이해하는 차원에서 통계 기반 분석기를 개강 전까지 만든다. FoundationsOfStatisticalNaturalLanguageProcessing 를 참조하자.
- 공개선언/메세지 . . . . 1 match
[[TableOfContents]]
- 공학적마인드 . . . . 1 match
안쪽으로는 논리적으로 각 변수들을 연결시키며 내적정합성을 유지하고, 현실에서 실제 관찰한 측정치값들을 근거로 '외적정합성'을 최대한 유지하며 미래를 예측하는, 그리고 여기에 '공학', 즉 'Trade-Off' 를 적용하여 input 에 대한 노력 대비 output 을 최대로 이끌어내는 것이 [공학적마인드] 가 아닐까 생각해봅니다.
- 구구단/Leonardong . . . . 1 match
Object subclass: #NameOfSubclass
[Transcript show: gob*pp;cr.
- 구근 . . . . 1 match
[[TableOfContents]]
- 권순의 . . . . 1 match
[[TableOfContents]]
- 권영기/web crawler . . . . 1 match
[[tableofcontents]]
* http://coreapython.hosting.paran.com/howto/HOWTO%20Fetch%20Internet%20Resources%20Using%20urllib2.htm
say = "This is a line of text"
part == ['This', 'is', 'a', 'line', 'of', 'text']
* 문서 - http://wiki.wxpython.org/How%20to%20Learn%20wxPython
2. Eclipse에서, Help > Install New Software > Add > PyDev, Http://pydev.org/updates
* http://www.crummy.com/software/BeautifulSoup/ - 웹분석 라이브러리 BeautifulSoup 이용해보기
- 그래픽스세미나/1주차 . . . . 1 match
[[TableOfContents]]
* 비교하기전에 걸러내는 방법으로는 Cohen-Sutherland 알고리즘이 있다.
- 그래픽스세미나/2주차 . . . . 1 match
[[TableOfContents]]
- 그래픽스세미나/3주차 . . . . 1 match
[[TableOfContents]]
- 그래픽스세미나/5주차 . . . . 1 match
[[TableOfContents]]
*MATERIAL_XP_FALLOFF 0.0000
*MATERIAL_FALLOFF In
*MATERIAL_XP_FALLOFF 0.0000
*MATERIAL_FALLOFF In
- 그래픽스세미나/6주차 . . . . 1 match
[[TableOfContents]]
- 김남규 . . . . 1 match
[[TableOfContents]]
- 김수경 . . . . 1 match
[[TableOfContents]]
- 김정욱 . . . . 1 match
[[TableOfContents]]
== Profile ==
* [http://www.miksoft.net]
* MIK(Made In Korea) soft 의 설립. 우주 최고의 소프트웨어 개발사로 키우는 것이 목표.
== Profile ==
- 김태형 . . . . 1 match
|| [[TableOfContents]] ||
== Profile ==
- 김해천 . . . . 1 match
[[TableOfContents]]
- 김희성 . . . . 1 match
[[TableOfContents]]
- 나를만든책장관리시스템 . . . . 1 match
[[TableOfContents]]
- 남자들에게 . . . . 1 match
[[TableOfContents]]
- 논문번역/2012년스터디 . . . . 1 match
* Experiments in Unconstrained Offline Handwritten Text Recognition
- 니젤프림/BuilderPattern . . . . 1 match
[[TableOfContents]]
builder.addHotel(first, "Patternsland 5 star Hotel");
- 다이얼로그박스의 엔터키 막기 . . . . 1 match
== How to ==
- 대학원준비 . . . . 1 match
[[TableOfContents]]
- 대학원준비06 . . . . 1 match
[[TableOfContents]]
- 덜덜덜/숙제제출페이지2 . . . . 1 match
||[[TableOfContents]]||
- 데블스캠프 . . . . 1 match
[[TableOfContents]]
- 데블스캠프2002/날적이 . . . . 1 match
* Scenario Driven 관계상 중간중간 실제 프로그램 구현시 어떻게 할것인가를 자주 언급되었다. 'What' 과 'How' 의 분리면에서는 두 사고과정이 왕복되는 점에서 효율성이 떨어진다고 생각한다.
- 데블스캠프2003/넷째날 . . . . 1 match
[[TableOfContents]]
- 데블스캠프2003/넷째날/Linux실습 . . . . 1 match
[[TableOfContents]]
Unix Philosophy를 경험하게 해주는 건 어떨까요? 예컨대 Software Tools 철학을 경험하게 해주는 것이죠. 개별적인 커맨드를 하나씩 가르쳐주는 것도 의미있을 수 있지만 학습은 학습자 스스로 뭔가를 "구성"해 볼 때 발생합니다. 단순 암기는 피해야 할 것입니다.
- 데블스캠프2003/다섯째날 . . . . 1 match
[[TableOfContents]]
- 데블스캠프2003/둘째날 . . . . 1 match
[[TableOfContents]]
- 데블스캠프2003/셋째날 . . . . 1 match
[[TableOfContents]]
- 데블스캠프2003/첫째날 . . . . 1 match
[[TableOfContents]]
- 데블스캠프2004/금요일 . . . . 1 match
[[TableOfContents]]
* JFrame의 show() 메소드 -> 프레임창을 보이게 한다.
helloWorld.show();
f.show();
helloWorld.show();
helloWorld.show();
helloWorld.show();
- 데블스캠프2004/세미나주제 . . . . 1 match
* 자료구조 SeeAlso HowToStudyDataStructureAndAlgorithms, DataStructure StackAndQueue 뒤의 두 페이지들의 용어와 내용이 어울리지 않네요. 아, 일반 용어를 프로젝트로 시작한 페이지의 마지막 모습이군요. )
- 데블스캠프2005/Python . . . . 1 match
|| [[TableOfContents]] ||
- 데블스캠프2005/RUR-PLE . . . . 1 match
[[TableOfContents]]
turn_off()
turn_off()
turn_off()
- 데블스캠프2005/RUR-PLE/Harvest . . . . 1 match
|| [[TableOfContents]] ||
turn_off()
turn_off()
turn_off()
turn_off()
turn_off()
turn_off()
turn_off()
turn_off
- 데블스캠프2005/RUR-PLE/Harvest/Refactoring . . . . 1 match
[[TableOfContents]]
turn_off()
turn_off()
turn_off()
turn_off()
turn_off()
turn_off()
turn_off()
turn_off()
- 데블스캠프2005/RUR-PLE/Newspaper . . . . 1 match
[[TableOfContents]]
turn_off()
turn_off()
- 데블스캠프2005/RUR-PLE/Newspaper/Refactoring . . . . 1 match
[[TableOfContents]]
turn_off()
turn_off()
- 데블스캠프2005/RUR-PLE/SelectableHarvest . . . . 1 match
[[TableOfContents]]
turn_off()
turn_off()
turn_off()
turn_off()
- 데블스캠프2005/RUR-PLE/Sorting . . . . 1 match
[[TableOfContents]]
turn_off()
move_endof_sub()
move_endof()
def move_endof_sub():
def move_endof():
move_endof()
turn_off()
turn_off()
turn_off()
- 데블스캠프2006/SSH . . . . 1 match
[[TableOfContents]]
- 데블스캠프2006/목요일/winapi . . . . 1 match
[[TableOfContents]]
PSTR szCmdLine, int iCmdShow)
PSTR szCmdLine, int iCmdShow)
ShowWindow (hwnd, iCmdShow) ;
PSTR szCmdLine, int iCmdShow)
ShowWindow (hwnd, iCmdShow) ;
PSTR szCmdLine, int iCmdShow)
ShowWindow (hwnd, iCmdShow) ;
PSTR szCmdLine, int iCmdShow)
ShowWindow (hwnd, iCmdShow) ;
- 데블스캠프2006/월요일 . . . . 1 match
[[TableOfContents]]
- 데블스캠프2006/준비/월요일 . . . . 1 match
[[TableOfContents]]
- 데블스캠프2006/화요일 . . . . 1 match
[[TableOfContents]]
- 데블스캠프2009/금요일 . . . . 1 match
[[TableOfContents]]
- 데블스캠프2009/목요일 . . . . 1 match
[[TableOfContents]]
- 데블스캠프2009/수요일 . . . . 1 match
[[TableOfContents]]
- 데블스캠프2009/월요일 . . . . 1 match
[[TableOfContents]]
- 데블스캠프2009/화요일 . . . . 1 match
[[TableOfContents]]
- 데블스캠프2010 . . . . 1 match
[[Tableofcontents]]
[HowToCodingWell] [SibichiSeminar]
- 데블스캠프2010/다섯째날/ObjectCraft . . . . 1 match
0. Why > How
- 데블스캠프2010/회의록 . . . . 1 match
[[TableOfContents]]
- 데블스캠프2011/다섯째날/HowToWriteCodeWell/강소현,구자경 . . . . 1 match
//for(int i=0; i<el.numOfPeople();i++)//사람 수만큼 엘레베이터 이동
- 데블스캠프2011/다섯째날/Lua . . . . 1 match
LUA Official Site http://www.lua.org
- 데블스캠프2011/다섯째날/후기 . . . . 1 match
== 변형진/How To Write Code Well ==
* 코드 잘 짜는 법. 신경써야 할 부분을 최소한으로 줄이자. 필요한 것을 먼저 쓰고 구현은 나중에 한다. 자주, 많이. very very many many
- 데블스캠프2011/둘째날/후기 . . . . 1 match
* 씐나는 Cheat-Engine Tutorial이군요. Off-Line Game들 할때 이용했던 T-Search, Game-Hack, Cheat-O-Matic 과 함께 잘 사용해보았던 Cheat-Engine입니다. 튜토리얼이 있는지는 몰랐네요. 포인터를 이용한 메모리를 바꾸는 보안도 찾을수 있는 대단한 성능이 숨겨져있었는지 몰랐습니다. 감격 감격. 문명5할때 문명 5에서는 값을 *100 + 난수로 해놔서 찾기 어려웠는데 참. 이제 튜토리얼을 통해 어떤 숨겨진 값들도 다 찾을 수 있을것 같습니다. 그리고 보여주고 준비해왔던 얘제들을 통해 보안이 얼마나 중요한지 알게되었습니다. 보안에 대해 많은걸 생각하게 해주네요. 유익한시간이었습니다. 다음에 관련 책이 있다면 한번 읽어볼 생각이 드네요.
while (!feof(fpe)) {
while (!feof(fpp)) {
- 데블스캠프2012/넷째날/후기 . . . . 1 match
[[TableOfContents]]
- 데블스캠프2012/둘째날/후기 . . . . 1 match
[[TableOfContents]]
- 데블스캠프2012/셋째날/코드 . . . . 1 match
[[TableOfContents]]
- 데블스캠프2012/셋째날/후기 . . . . 1 match
[[TableOfContents]]
- 데블스캠프2012/첫째날/후기 . . . . 1 match
[[TableOfContents]]
* 첫 날이라 그래도 쉬운 내용을 한다고 했는데 새내기들이 어떻게 받아들였을지 궁금하네요. 하긴 저도 1학년 때 뭔 소리를 하나 했지만 -ㅅ-;;; 그래도 struct를 사용해서 많이 만들어 본 것 같아 좋았습니다. UI는 뭐랄까.. Microsoft Expression은 한번도 안 써 봤는데 그런게 있다는 것을 알 수 있어 좋았습니다. 페챠쿠챠에서는 서로가 어떤 것을 좋아하는지나 어떠한 곳에서 살았는지에 대해서 재미있게 알 수 있는 것 같아 좋았습니다. 아 베이스 가르쳐 달라고 하신 분,, 나중에 학회실로 오세요-.. 미천하지만 어느 정도 가르쳐는 줄 수 있.........
* 첫째 날 데블스 캠프는 정말 재미있었습니다. 우선 C 수업 중에 배우지 않은 문자열 함수와 구조체에 대해 배웠습니다. 또 수업 중에 배운 함수형 포인터를 실제로 사용해(qsort.... 잊지않겠다) 볼 수 있었습니다. 또 GUI를 위해 Microsoft Expression을 사용하게 됬는데, 이런 프로그램도 있었구나! 하는 생각이 들었습니다. GUI에서 QT Creator라는 것이 있다는 것도 오늘 처음 알게 되었습니다. 데블스 캠프를 통해 많은 것을 배울 수 있었습니다.
- 동문서버위키 . . . . 1 match
동문서버위키가 현 상황에서 제로페이지의 위키나 다른 성공적 위키 사이트에 비해 상대적으로 사용이 저조하고 NoSmok:DegreeOfWikiness 가 낮고 무엇보다도 사람들이 해당 위키를 통해 얻는 "삶 속에서의 가치"(혹은 효용)가 없어서 한마디로 실패한 커뮤니티 사이트가 된 이유는 무엇일까.
- 땅콩이보육프로젝트2005 . . . . 1 match
[[TableOfContents]]
- 레밍즈프로젝트/다이어그램 . . . . 1 match
{{| [[TableOfContents]] |}}
- 루프는0부터? . . . . 1 match
||[[TableOfContents]]||
- 만년달력/김정현 . . . . 1 match
sw.write(String.valueOf(i)+space);
- 만세삼창VS디아더스1차전 . . . . 1 match
[[TableOfContents]]
- 몸짱프로젝트 . . . . 1 match
SeeAlso [HowToStudyDataStructureAndAlgorithms] [DataStructure] [http://internet512.chonbuk.ac.kr/datastructure/data/ds1.htm 자료구조 정리]
- 몸짱프로젝트/BinarySearchTree . . . . 1 match
|| [[TableOfContents]] ||
## if self.getNumofChildren( node ) == 0:
## elif self.getNumofChildren( node ) == 1:
if node.numofChildren() == 0:
elif node.numofChildren() == 1:
def getNumofChildren( self, aNode ):
def numofChildren(self):
## def testGetNumofChildren(self):
## self.assertEquals(bst.getNumofChildren( bst.root ), 2 )
if node.numofChildren() == 0:
elif node.numofChildren() == 1:
def numofChildren(self):
- 몸짱프로젝트/CrossReference . . . . 1 match
|| [[TableOfContents]] ||
aRoot.show()
def show(self):
while(!fin.eof())
void show(ostream & aOs, Node_ptr aNode);
void showAll(ostream & aOs, Node_ptr aRoot);
int num_of_node = 0;
while(!fin.eof()){
//ofstream fout("result.txt", ios::app); // result.txt 라는 파일에 출력하는 경우
//showAll(fout, root);
showAll(cout, root);
show(aOs, aRoot);
num_of_node++;
void show(ostream & aOs, Node_ptr aNode)
void showAll(ostream & aOs, Node_ptr aRoot)
<< "TOTAL" << "\t\t" << num_of_node++ << endl;
- 무엇을공부할것인가 . . . . 1 match
Game Developer, System Software Developer, Software Architect, 전산학자 식으로 각각의 직업과 관련된 지식에 대한 Roadmap 은 어떨까요? (예전에 '~~한 개발자가 되기 위한 book map' 같은 것도 있었던 것 같은데)
SeparationOfConcerns로 유명한 데이비드 파르나스(David L. Parnas)는 FocusOnFundamentals를 말합니다. (see also ["컴퓨터고전스터디"]) 최근 작고한 다익스트라(NoSmok:EdsgerDijkstra )는 수학과 언어적 능력을 말합니다. ''Besides a mathematical inclination, an exceptionally good mastery of one's native tongue is the most vital asset of a competent programmer. -- NoSmok:EdsgerDijkstra '' 참고로 다익스트라는 자기 밑에 학생을 받을 때에 전산학 전공자보다 수학 전공자에게 더 믿음이 간다고 합니다.
job descriptions most of the time. But software development isn't that much
- Dividing software into components
software industry.
- Software reliability: that's a difficult one. IMO experience,
- 문제풀이/1회 . . . . 1 match
[[TableOfContents]]
- 물푸 . . . . 1 match
[[TableOfContents]]
- 박범용 . . . . 1 match
||[[TableOfContents]]||
== Profile ==
- 박성현 . . . . 1 match
== Profile ==
* [http://wiki.kldp.org/wiki.php/DocbookSgml/Ask-TRANS How To Ask Questions The Smart Way]
- 박원석 . . . . 1 match
|| [[TableOfContents]] ||
== Profile ==
- 병역문제어떻게해결할것인가 . . . . 1 match
[[TableOfContents]]
* MOU체결 기관으로는 SW 마에스트로, BoB( Best of Best)가 알려져 있으며, 소마가 훨~씬 널럴하고 쉬우니 소마를 추천
- 병희 . . . . 1 match
[[TableOfContents]]
- 복/숙제제출 . . . . 1 match
[[TableOfContents]]
- 부자아빠가난한아빠1,2 . . . . 1 match
[[TableOfContents]]
- 블로그2007 . . . . 1 match
[[TableOfContents]]
- 비행기게임 . . . . 1 match
[[TableOfContents]]
- 빵페이지/도형그리기 . . . . 1 match
||[[TableOfContents]]||
memset(bitmap, 0, sizeof(bitmap));
void showmenu();
showmenu();
showmenu();
void showmenu()
num = input("plz input number of asterisk: ")
cout << "plz number of asterisk:";
cout << "plz number of asterisk:";
- 빵페이지/마방진 . . . . 1 match
||[[TableOfContents]]||
- 빵페이지/숫자야구 . . . . 1 match
||[[TableOfContents]]||
- 상욱 . . . . 1 match
[[TableOfContents]]
=== Profile ===
- 상협 . . . . 1 match
[[TableOfContents]]
- 상협/2DAlca . . . . 1 match
[[TableOfContents]]
- 상협/Diary/7월 . . . . 1 match
[[TableOfContents]]
* Designing Object-Oriented Software 이책이랑 Refactoring 책 빌려야징..
- 상협/Diary/8월 . . . . 1 match
[[TableOfContents]]
* Designing Object-Oriented Software 이책 다보기 Failure (집에 내려가서 해야징.)
- 상협/Diary/9월 . . . . 1 match
[[TableOfContents]]
- 상협/Medusa . . . . 1 match
[[TableOfContents]]
- 상협/감상 . . . . 1 match
[[TableOfContents]]
|| [PatternOrientedSoftwareArchitecture]|| || 1권(1) || - || 뭣도 모르고 보니깐 별로 감이 안온다 -_-; ||
- 상협/나는희망의증거가되고싶다 . . . . 1 match
[[TableOfContents]]
- 상협/모순 . . . . 1 match
[[TableOfContents]]
- 상협/삽질일지 . . . . 1 match
[[TableOfContents]]
- 상협/삽질일지/2002 . . . . 1 match
[[TableOfContents]]
- 상협/프로젝트관련 . . . . 1 match
[[TableOfContents]]
- 새싹C스터디2005 . . . . 1 match
[[TableOfContents]]
- 새싹C스터디2005/pointer . . . . 1 match
[[TableOfContents]]
ArrayOutput(array, sizeof(array)/sizeof(int));
- 새싹교실/2011 . . . . 1 match
[[TableOfContents]]
각 파트의 역할, program의 실행원리, software(layer 활용), complier와 interpreter 역할
- 새싹교실/2011/A+ . . . . 1 match
[[TableOfContents]]
새싹교실이 끝난뒤 배운 while문과 '윤종하 게임'에서 뽑아온 switch코드를 이용해서 [고한종/on-off를 조절 할 수 있는 코드]를 만들어 내었다. 아이 싱난다. -> 이런게 피드백 인가염?
- 새싹교실/2011/AmazingC . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/AmazingC/5일차(4월 14일) . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/AmazingC/6일차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/GGT . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/GGT/L1&L2 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/Noname . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/Pixar . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/Pixar/3월 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/Pixar/4월 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/Pixar/5월 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/Pixar/실습 . . . . 1 match
[[TableOfContents]]
Write a program that reads a four digit integer and prints the sum of its digits as an output.
- 새싹교실/2011/學高 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/學高/1회차 . . . . 1 match
[[TableOfContents]]
* Kinds of programming language: C, C++, Java, Assembly, Python etc.
* 4 levels of programming: coding -> compile -> linking -> debugging(running). and type of error of an each level.
- 새싹교실/2011/學高/2회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/學高/3회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/學高/4회차 . . . . 1 match
[[TableOfContents]]
* The sum of your integers plus 7 is 19
- 새싹교실/2011/學高/5회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/學高/6회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/學高/7회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/데미안반 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/무전취식/레벨1 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/무전취식/레벨10 . . . . 1 match
[[TableOfContents]]
* 개념 정리에 대해서는 그다지 많은 가르침이 없었습니다. 오늘의 집중 항목은 여러명이 코딩하는 방법과 직접 코딩을 해보는것이었죠. 지각에 대해서도 한마디했군요!! 지각할때 상대방의 양해를 구하지 않는것은 상대방에게 크나큰 실례입니다~ 모두 지각한다면 먼저 알려주는 센스쟁이가 되주세요. 오늘은 진경이가 와줘서 너무 기쁩니다. 든든한 조교가 있으니 강사가 무능해도 잘 진행되는군요. Show me the money!!! 담시간을 기대하시라!! 또한 태진이도 들으러와서 신나보이는 새싹이었습니다. 이런 수업방식이 적응이 안될수도잇죠. 신나고 신나게 배우고 먹고 마시는것입니다. 이게 맞는지는모르겠지만 학생들이 모쪼록 제 배움을 즐겁게 받아들여주었스면 좋겠습니다. 다음시간에도 Coding Coding입니다!! 얏후!! 후기써라. - [김준석]
- 새싹교실/2011/무전취식/레벨11 . . . . 1 match
[[TableOfContents]]
// assume 'S' is on the left side of the maze
- 새싹교실/2011/무전취식/레벨2 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/무전취식/레벨3 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/무전취식/레벨4 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/무전취식/레벨5 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/무전취식/레벨6 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/무전취식/레벨7 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/무전취식/레벨8 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/무전취식/레벨9 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/쉬운것같지만쉬운반/2011.3.15 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/쉬운것같지만쉬운반/2011.3.23 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/쉬운것같지만쉬운반/2011.3.29 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/쉬운것같지만쉬운반/2011.4.6 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/쉬운것같지만쉬운반/2011.5.17 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/쉬운것같지만쉬운반/2011.5.3 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/씨언어발전 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/씨언어발전/2회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/씨언어발전/3회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/씨언어발전/4회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/씨언어발전/5회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2011/씨언어발전/6회차 . . . . 1 match
[[TableOfContents]]
p=(int*)malloc(sizeof(int)*num);
p=(int*)malloc(sizeof(int)*a);
- 새싹교실/2012 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/ABC반 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/AClass . . . . 1 match
[[TableOfContents]]
* hint) Dp = (int**)malloc(sizeof(int*));
동적할당에 대해서도 배웠습니다.sizeof라는 함수를 사용하여 할당 할 크기를 정해주고 malloc을 사용하여 방을 만들어 줍니다.
p = (int *)malloc(SIZEOF(int)*n);}}}
node* head=(node*)malloc(sizeof(node));
tmp->next = (node*)malloc(sizeof(node));
struct node *head=(struct node*)malloc(sizeof(struct node));
tmp->next=(struct node*)malloc(sizeof(struct node));
node *head = (node *)malloc(sizeof(node));
tmp->next = (node *)malloc(sizeof(node));
- 새싹교실/2012/Dazed&Confused . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/강력반 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/개차반 . . . . 1 match
[[TableOfContents]]
* real part of program
* It has start and end point of a program.
* Integer type: int(4 bytes), char(1 byte, be often used to express a character)
* Maximum, minimum value of int(경우의 수 이용)
* Example Problem: Write a program that converts meter-type height into [feet(integer),inch(float)]-type height. Your program should get one float typed height value as an input and prints integer typed feet value and the rest of the height is represented as inch type. (1m=3.2808ft=39.37inch) (출처: 손봉수 교수님 ppt)
- 새싹교실/2012/나도할수있다 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/도자기반 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/반반 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/벽돌쌓기 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/부부동반 . . . . 1 match
[[TableOfContents]]
* Hardware / Programming Language / Software의 상관관계
- 새싹교실/2012/사과나무 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/사과나무/과제방 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/새싹교실강사교육 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/새싹교실강사교육/1주차 . . . . 1 match
[[TableOfContents]] 자동 목차
- 새싹교실/2012/아무거나 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/아우토반 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/아우토반/뒷반/3.23 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/아우토반/뒷반/3.30 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/아우토반/뒷반/4.13 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/아우토반/뒷반/4.6 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/아우토반/뒷반/5.11 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/아우토반/앞반/3.22 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/아우토반/앞반/3.29 . . . . 1 match
[[TableOfContents]]
(1) sizeof 연산자를 이용하여 int, char, float, double 변수와 그 변수를 가리키는 포인터 변수가 메모리를 차지하는 용량을 구하시오(소스 코드 및 결과)
printf("sizeof(a) = %d \n", sizeof(a));
printf("sizeof(b) = %d \n", sizeof(b));
printf("sizeof(c) = %d \n", sizeof(c));
printf("sizeof(d) = %d \n", sizeof(d));
sizeof(a) = 4
sizeof(b) = 1
sizeof(c) = 4
sizeof(d) = 8
printf("sizeof(a) = %d, 크기는 %d \n",sizeof(a),sizeof(int));
printf("sizeof(b) = %d, 크기는 %d \n ",sizeof(b),sizeof(char));
printf("sizeof(c) = %d, 크기는 %d \n",sizeof(c),sizeof(float));
printf("sizeof(d) = %d, 크기는 %d \n ",sizeof(d),sizeof(double));
sizeof(a) = 4, 크기는 4
sizeof(b) = 1, 크기는 1
sizeof(c) = 8, 크기는 8
sizeof(d) = 4, 크기는 4
- 새싹교실/2012/아우토반/앞반/4.12 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/아우토반/앞반/4.19 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/아우토반/앞반/4.5 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/아우토반/앞반/5.10 . . . . 1 match
[[TableOfContents]]
printf("%d %d\n", sizeof(*pA), sizeof(pA));
printf("%d %d\n", sizeof(*pB), sizeof(pB));
printf("%d %d\n", sizeof(*pC), sizeof(pC));
printf("%d %d\n", sizeof(*pD), sizeof(pD));
printf("%d %d\n", sizeof(*pA), sizeof(pA)); //*pa의 문자열은 int(4), pA의 문자열은 int(4)
printf("%d %d\n", sizeof(*pB), sizeof(pB)); // pB의 문자열은 int(4), *pB의 문자열은 int(4)
printf("%d %d\n", sizeof(*pC), sizeof(pC)); // *pC의 문자열은 char(1), pC의(주소값)문자열은 int(4)
printf("%d %d\n", sizeof(*pD), sizeof(pD)); // *pD의 문자열은 double(8), pD의 (주소값)문자열은 int(4)
printf("%d %d\n", sizeof(*pA), sizeof(pA));
printf("%d %d\n", sizeof(*pB), sizeof(pB));
printf("%d %d\n", sizeof(*pC), sizeof(pC));
printf("%d %d\n", sizeof(*pD), sizeof(pD));
- 새싹교실/2012/아우토반/앞반/5.17 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/앞부분만본반 . . . . 1 match
[[TableOfContents]]
3. infinitely many solution
A system of linear equation is said to be consistent if it has either one solution or infinitely many solutions; a system is inconsistent if it has no solution.
system이 infinitely many solutions일 때도 consistent가 아닌가요? 궁금해서 질문 올립니다.- [김희성]
infinitely many solutions 일때도 consistent합니다.
- 새싹교실/2012/열반/120319 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/열반/120326 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/열반/120402 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/열반/120409 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/열반/120507 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/열반/120514 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/열반/120521 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/열반/120604 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/우리반 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/절반 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/절반/중간고사전 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/절반/중간고사후 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/주먹밥 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/주먹밥/이소라때리기게임 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/클러그 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/탈락 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2012/해보자 . . . . 1 match
[[TableOfContents]]
* sizeof(parameter): 매개변수가 가지고 있는 메모리상의 바이트 단위의 정수를 반환한다.
* sizeof(int) = 4, sizeof(char) = 1, sizeof(short) = 2 etc.
- 새싹교실/2012/햇반 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/라이히스아우토반 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/라이히스아우토반/1회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/라이히스아우토반/2회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/라이히스아우토반/3회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/라이히스아우토반/4회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/라이히스아우토반/6회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/라이히스아우토반/7회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/록구록구 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/록구록구/10회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/록구록구/11회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/록구록구/1회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/록구록구/2회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/록구록구/3회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/록구록구/4회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/록구록구/5회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/록구록구/6회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/록구록구/8회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/록구록구/9회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/양반 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/양반/1회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/양반/2회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/양반/3회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/양반/4회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/양반/5회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/양반/6회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/양반/7회차 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/이게컴공과에게 참좋은데 말로설명할 길이 없네반 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/책상운반 . . . . 1 match
[[TableOfContents]]
- 새싹교실/2013/케로로반 . . . . 1 match
[[TableOfContents]]
- 새싹스터디2006 . . . . 1 match
[[TableOfContents]]
- 새싹스터디2007 . . . . 1 match
[[TableOfContents]]
- 성균관대게임개발대회 . . . . 1 match
[[TableOfContents]]
- 소유냐존재냐 . . . . 1 match
[[TableOfContents]]
- 송치완 . . . . 1 match
[[TableOfContents]]
- 수/구구단출력 . . . . 1 match
||[[TableOfContents]]||
- 수/마름모출력 . . . . 1 match
||[[TableOfContents]]||
- 수/별표출력 . . . . 1 match
||[[TableOfContents]]||
- 수/정렬 . . . . 1 match
||[[TableOfContents]]||
- 스네이크바이트 . . . . 1 match
[[TableOfContents]]
- 스터디/Nand 2 Tetris . . . . 1 match
[[TableOfContents]]
OUT sum, // Right bit of a + b
carry; // Left bit of a + b
OUT sum, // Right bit of a + b + c
carry; // Left bit of a + b + c
- 시간관리하기 . . . . 1 match
DeleteMe) 영어로 쓰려면 HowToManagement... 류가 되려나. -_-; 개인적으로 그리 치열하게 살지 않는 사람으로서 이런 페이지 글 적는게 좀 그렇지만. -_-; 일단 화두 제공용. 질문하기위해 연 페이지라고 생각하시길. --["1002"]
- 시작 . . . . 1 match
''기울임'' '''굵게''' ''기울임'' ---- [페이지명 또는 URL] [(카페명)] [[TableOfContents]] == 제목(2번째크기) ==
- 신기호 . . . . 1 match
[[TableOfContents]]
== Profile ==
- 신기호/중대생rpg(ver1.0) . . . . 1 match
[[TableOfContents]]
* Total lines of code: 760(스압 주의)
while(strcmp(buff,"EOF")!=0){
fprintf(state,"EOF");
while(strcmp(buff,"EOF")!=0){
fprintf(file,"EOF");
- 아는것으로부터의자유 . . . . 1 match
[[TableOfContents]]
- 아잉블러그 . . . . 1 match
[[TableOfContents]]
- 아직도가야할길 . . . . 1 match
[[TableOfContets]]
- 안혁준 . . . . 1 match
* [HowTo] 시리즈 집필
- 양쪽의 클래스를 참조 필요시 . . . . 1 match
== How to ==
- 영어학습방법론 . . . . 1 match
[[TableOfContents]]
=== 질문 2. 히어링. 특히 단어 자체의 발음을 외우다가 문장내에서 연음사이에 그런 단어들을 어떻게 알 수 있는가? 전치사(on, of 등등)과 관사 (a, the, these)등 발음을 확실하게 하지 않는 단어들을 어떻게 알 수 있는가? ===
* Oxford Advanced Learner's Dictionary of Current English (6th Edition이상)
* The Longman Dictionary of Contemporary English (Addison Wesley Longman, 3rd Edition이상)
- 오목/곽세환,조재화 . . . . 1 match
// ohbokView.h : interface of the COhbokView class
// Microsoft Visual C++ will insert additional declarations immediately before the previous line.
// ohbokView.cpp : implementation of the COhbokView class
ASSERT(m_pDocument->IsKindOf(RUNTIME_CLASS(COhbokDoc)));
- 오목/민수민 . . . . 1 match
// sampleView.h : interface of the CSampleView class
// Microsoft Visual C++ will insert additional declarations immediately before the previous line.
// sampleView.cpp : implementation of the CSampleView class
ASSERT(m_pDocument->IsKindOf(RUNTIME_CLASS(CSampleDoc)));
- 오목/재니형준원 . . . . 1 match
// OmokView.h : interface of the COmokView class
// Microsoft Visual C++ will insert additional declarations immediately before the previous line.
// omokView.cpp : implementation of the COmokView class
ASSERT(m_pDocument->IsKindOf(RUNTIME_CLASS(COmokDoc)));
- 오목/재선,동일 . . . . 1 match
// singleView.h : interface of the CSingleView class
// Microsoft Visual C++ will insert additional declarations immediately before the previous line.
// singleView.cpp : implementation of the CSingleView class
ASSERT(m_pDocument->IsKindOf(RUNTIME_CLASS(CSingleDoc)));
- 우리홈만들기 . . . . 1 match
[[TableOfContents]]
- 우주변화의원리 . . . . 1 match
[[TableOfContents]]
- 위키QnA . . . . 1 match
A: {{{~cpp [[TableOfContents]] }}} 매크로를 사용해보시는 건 어떨까요? 소제목들에 대한 내부링크를 만들어줍니다. 링크의 기준은 === ===, == == 등으로 묶인 헤더태그들 기준입니다.
- 위키개발2006 . . . . 1 match
[[TableOfContents]]
- 위키기본css단장 . . . . 1 match
|| [[TableOfContents]] ||
- 위키설명회2005/PPT준비 . . . . 1 match
|| [[TableOfContents]] ||
- 유용한팁들 . . . . 1 match
[[TableOfContents]]
- 윤현수 . . . . 1 match
|| [[TableOfContents]] ||
== Profile ==
- 이기적인유전자 . . . . 1 match
[[TableOfContents]]
- 이동현 . . . . 1 match
== Profile ==
[StacksOfFlapjacks/이동현]
- 이병윤 . . . . 1 match
[[TableOfContents]]
== Profile ==
- 이성의기능 . . . . 1 match
[[TableOfContents]]
- 이승한/PHP . . . . 1 match
[[TableOfContents]]
- 이연주/공부방 . . . . 1 match
|| [[TableOfContents]] ||
http://prof.cau.ac.kr/~sw_kim/include.htm
printf(" abc %d\n", sizeof(abc));
printf(" abc[1] %d\n", sizeof(abc[1]));
printf(" bcd %d\n", sizeof(bcd));
printf(" *bcd %d\n", sizeof(*bcd));
printf(" *(bcd+1) %d\n", sizeof(*(bcd+1)));
- 이영호/개인공부일기장 . . . . 1 match
☆ 구입해야할 책들 - Advanced Programming in the UNIX Environment, Applications for Windows, TCP/IP Illustrated Volume 1, TCP/IP Protocol Suite, 아무도 가르쳐주지않았던소프트웨어설계테크닉, 프로젝트데드라인, 인포메이션아키텍쳐, 초보프로그래머가꼭알아야할컴퓨터동작원리, DirectX9Shader프로그래밍, 클래스구조의이해와설계, 코드한줄없는IT이야기, The Art of Deception: Controlling the Human Element of Security, Advanced Windows (Jeffrey Ritcher), Windows95 System Programming (Matt Pietrek)
☆ 앞으로 공부해야할 책들(사둔것) - Effective C++, More Effective C++, Exeptional C++ Style, Modern C++ Design, TCP/IP 네트워크 관리(출판사:O'Reilly), C사용자를 위한 리눅스 프로그래밍, Add-on Linux Kernel Programming, Physics for Game Developers(출판사:O'Reilly), 알고리즘(출판사:O'Reilly), Hacking Howto(Matt 저), Windows 시스템 실행 파일의 구조와 원리, C언어로 배우는 알고리즘 입문
☆ 18 (월) - /usr/bin/wall Command에 관심을 보임. bof만 제대로 먹히면 root를 먹을 수 있을 것 같음. (binutils 소스를 구해서 분석해봐야겠음.)
- 이원희 . . . . 1 match
[[TableOfContents]]
- 이현정 . . . . 1 match
[[TableOfContents]]
- 일반적인사용패턴 . . . . 1 match
[[TableOfContents]]
- 일취집중후각법 . . . . 1 match
["Refactoring"]의 도를 얻기 위한 수련법의 하나. see also HowToStudyRefactoring
- 임시 . . . . 1 match
[http://www.cse.buffalo.edu/~rapaport/howtostudy.html How to study]
Professional & Technical: 173507
http://en.wikipedia.org/wiki/List_of_IPv4_protocol_numbers protocol number
gethostname(myName, sizeof(myName));
In the first stage, you will write a multi-threaded server that simply displays the contents of the HTTP request message that it receives. After this program is running properly, you will add the code required to generate an appropriate response.
This section explains how to use REST (Representational State Transfer) to make requests through Amazon E-Commerce Service (ECS). REST is a Web services protocol that was created by Roy Fielding in his Ph.D. thesis (see Architectural Styles and the Design of Network-based Software Architectures for more details about REST).
REST allows you to make calls to ECS by passing parameter keys and values in a URL (Uniform Resource Locator). ECS returns its response in XML (Extensible Markup Language) format. You can experiment with ECS requests and responses using nothing more than a Web browser that is capable of displaying XML documents. Simply enter the REST URL into the browser's address bar, and the browser displays the raw XML response.
SearchIndex : Books, Toys, DVD, Music, VideoGames, Software or any other of Amazon's stores
- 임인책/북마크 . . . . 1 match
[[TableOfContents]]
* Seminar:SoftwarePioneers
- 임인택/농활준비 . . . . 1 match
[[TableOfContents]]
- 자유로부터의도피 . . . . 1 match
[[TableOfContents]]
- 작은자바이야기 . . . . 1 match
[[TableOfContents]]
- 장용운 . . . . 1 match
[[TableOfContents]]
- 재미있게공부하기 . . . . 1 match
''재미있는 것부터 하기''와 비슷하게 특정 부분을 고르고 그 놈을 집중 공략해서 공부하는 방법이다. 이 때 가능하면 여러개의 자료를 총 동원한다. 예를 들어 논리의 진리표를 공부한다면, 논리학 개론서 수십권을 옆에 쌓아놓고 인덱스를 보고 진리표 부분만 찾아읽는다. 설명의 차이를 비교, 관찰하라(부수적으로 좋은 책을 빨리 알아채는 공력이 쌓인다). 대가는 어떤 식으로 설명하는지, 우리나라 번역서는 얼마나 개판인지 등을 살피다 보면 어느새 자신감이 붙고(최소한 진리표에 대해서 만큼은 빠싹해진다) 재미가 생긴다. see also HowToReadIt의 ''같은 주제 읽기''
- 전시회 . . . . 1 match
[[TableOfContents]]
- 정모/2002.5.30 . . . . 1 match
[[TableOfContents]]
- 정모/2002.8.22 . . . . 1 match
[[TableOfContents]]
- 정모/2003.3.5 . . . . 1 match
|| [[TableOfContents]] ||
- 정모/2007.1.12 . . . . 1 match
[[TableOfContents]]
- 정모/2007.1.19 . . . . 1 match
[[TableOfContents]]
- 정모/2011.10.12 . . . . 1 match
[[TableOfContents]]
- 정모/2011.10.5 . . . . 1 match
[[TableOfContents]]
- 정모/2011.11.16 . . . . 1 match
[[TableOfContents]]
* [http://onoffmix.com/event/4096 ZP성년식]
- 정모/2011.11.23 . . . . 1 match
[[TableOfContents]]
- 정모/2011.11.30 . . . . 1 match
[[TableOfContents]]
- 정모/2011.11.9 . . . . 1 match
[[TableOfContents]]
* [http://onoffmix.com/event/4096 ZP성년식];
- 정모/2011.12.7 . . . . 1 match
[[TableOfContents]]
- 정모/2011.3.14 . . . . 1 match
[[TableOfContents]]
- 정모/2011.3.2 . . . . 1 match
[[TableOfContents]]
- 정모/2011.3.21 . . . . 1 match
[[TableOfContents]]
1. 준석이 OMS(World of Warcraft) : 동영상을 적절하게 사용해서 집중력을 높여준 세미나였다. 아쉬운 점은 쪼----금 길었다는거;;
- 정모/2011.3.28 . . . . 1 match
[[TableOfContents]]
- 정모/2011.3.7 . . . . 1 match
[[TableOfContents]]
- 정모/2011.4.11 . . . . 1 match
[[TableOfContents]]
- 정모/2011.4.4 . . . . 1 match
[[TableOfContents]]
* 도와줘요 ZeroPage에서 무언가 영감을 받았습니다. 다음 새싹 때 이를 활용하여 설명을 해야겠습니다. OMS를 보며 SE시간에 배웠던 waterfall, 애자일, TDD 등을 되집어보는 시간이 되어 좋았습니다. 그리고 팀플을 할 때 완벽하게 이뤄졌던 예로 창설을 들었었는데, 다시 생각해보니 아니라는 걸 깨달았어요. 한명은 새로운 방식으로 하는 걸 좋아해서 교수님이 언뜻 알려주신 C언어 비슷한 언어를 사용해 혼자 따로 하고, 한명은 놀고, 저랑 다른 팀원은 기존 방식인 그림 아이콘을 사용해서 작업했었습니다 ㄷㄷ 그리고, 기존 방식과 새로운 방식 중 잘 돌아가는 방식을 사용했던 기억이.. 완성도가 높았던 다른 교양 발표 팀플은 한 선배가 중심이 되서 PPT를 만들고, 나머지들은 자료와 사진을 모아서 드렸던 기억이.. 으으.. 제대로 된 팀플을 한 기억이 없네요 ㅠㅠ 코드레이스는 페어로 진행했는데, 자바는 이클립스가 없다고 해서, C언어를 선택했습니다. 도구에 의존하던 폐해가 이렇게..ㅠㅠ 진도가 느려서 망한줄 알았는데, 막판에 현이의 아이디어가 돋보였어요. 메인함수는 급할 때 모든 것을 포용해주나 봅니다 ㄷㄷㄷ 제가 잘 몰라서 파트너가 고생이 많았습니다. 미안ㅠㅠ [http://en.wikipedia.org/wiki/Professor_Layton 레이튼 교수]가 실제로 게임으로 있었군요!! 철자를 다 틀렸네, R이 아니었어 ㅠㅠ- [강소현]
- 정모/2011.4.4/CodeRace . . . . 1 match
public void getOff(){
public void ThrowRook(ProfessorR r, Child c) {
public void crossRiver(ProfessorR r) {
public class ProfessorR {
public ProfessorR() {
System.out.println("Professor loc : " + str);
ProfessorR test = new ProfessorR();
- 정모/2011.5.23 . . . . 1 match
[[TableOfContents]]
- 정모/2011.5.30 . . . . 1 match
[[TableOfContents]]
* [정의정]의 One Man Show
* 7시에 튜터링이라 조금 일찍 가긴 했는데 (그런데 7시 20분에 나갔..) 뭐 거의 다 하고 나간 거 같네요,, 이번 OMS에서는 정말로 One Man Show에 대한 것을 봤는데요, 평소 그런 영상도 많이 봐서 그런지 조금 더 관심있게 봤던 것 같습니다. 뭐 보면 Five For Fighting과 같이 혼자 악기를 다루고 노래 해서 음반 발매하는 사람도 있으니깐요. 데블스 캠프 연락처를 받고 연락을 돌렸는데, 연락이 되신 분도 있는데 다시 연락 주신다고 하시고.. (뭐 하루밖에 안 지났지만..) 답이 없으시네요 -_-;; 이번 5월 회고에서는 색다른 방식으로 진행되었던 것 같습니다. Zeropage에게 인격을 부여하니 참 다양한 모습이 나와 재밌었습니다. 생각해 보니 별명을 슬레이어즈의 가우리로 할껄 그랬네요 (밥 못 먹었을 때의 모습 -_-) 아무튼 재밌는 회고였습니다. ㅎ - [권순의]
- 정모/2011.7.11 . . . . 1 match
[[TableOfContents]]
- 정모/2011.7.18 . . . . 1 match
[[TableOfContents]]
- 정모/2011.7.25 . . . . 1 match
[[TableOfContents]]
- 정모/2011.7.4 . . . . 1 match
[[TableOfContents]]
- 정모/2011.8.1 . . . . 1 match
[[TableOfContents]]
- 정모/2011.8.22 . . . . 1 match
[[TableOfContents]]
- 정모/2011.8.29 . . . . 1 match
[[TableOfContents]]
- 정모/2011.8.8 . . . . 1 match
[[TableOfContents]]
- 정모/2011.9.20 . . . . 1 match
[[TableOfContents]]
* [http://onoffmix.com/event/3672 개발자를 위한 공감세미나]
- 정모/2011.9.27 . . . . 1 match
[[TableOfContents]]
- 정모/2011.9.5 . . . . 1 match
[[TableOfContents]]
- 정모/2012.10.8 . . . . 1 match
[[TableOfContents]]
- 정모/2012.12.10 . . . . 1 match
* 저분들께 이 글을 보여드리고 싶다. [http://jimmyrim.com/159 Paul Graham의 How To Start a Startup], [http://www.jimmyrim.com/190 스타트업에서 일과 삶의 균형을 찾는 것은 맞지 않다.] 음.. 근데 저분들 스타트업 하려는거 맞나? - [서지혜]
- 정모/2012.3.19 . . . . 1 match
[[TableOfContents]]
- 정모/2012.4.30 . . . . 1 match
[[TableOfContents]]
- 정모/2012.4.9 . . . . 1 match
[[TableOfContents]]
- 정모/2012.5.14 . . . . 1 match
[[TableOfContents]]
- 정모/2012.5.21 . . . . 1 match
[[TableOfContents]]
- 정모/2012.5.7 . . . . 1 match
[[TableOfContents]]
- 정모/2012.6.4 . . . . 1 match
[[TableOfContents]]
- 정모/2012.7.11 . . . . 1 match
[[TableOfContents]]
- 정모/2012.7.18 . . . . 1 match
[[TableOfContents]]
- 정모/2012.7.25 . . . . 1 match
[[TableOfContents]]
* 학회실 안쪽 에어컨이 마스터 에어컨이라 6피 전체와 연결되어 있으니 에어컨 on/off시에 주의 바람.
- 정모/2012.8.1 . . . . 1 match
[[TableOfContents]]
- 정모/2012.8.22 . . . . 1 match
[[TableOfContents]]
- 정모/2012.8.29 . . . . 1 match
[[TableOfContents]]
- 정모/2012.8.8 . . . . 1 match
[[TableOfContents]]
- 정모/2012.9.10 . . . . 1 match
[[TableOfContents]]
- 정모/2012.9.17 . . . . 1 match
[[TableOfContents]]
- 정모/2012.9.24 . . . . 1 match
[[TableOfContents]]
- 정모/2013.1.15 . . . . 1 match
[[TableOfContents]]
- 정모/2013.1.22 . . . . 1 match
[[TableOfContents]]
- 정모/2013.1.29 . . . . 1 match
[[TableOfContents]]
- 정모/2013.1.8 . . . . 1 match
[[TableOfContents]]
- 정모/2013.2.12 . . . . 1 match
[[TableOfContents]]
- 정모/2013.2.19 . . . . 1 match
[[TableOfContents]]
- 정모/2013.2.26 . . . . 1 match
[[TableOfContents]]
- 정모/2013.3.25 . . . . 1 match
[[TableOfContents]]
- 정모/2013.3.4 . . . . 1 match
[[TableOfContents]]
- 정모/2013.4.1 . . . . 1 match
[[TableOfContents]]
- 정모/2013.4.15 . . . . 1 match
[[TableOfContents]]
- 정모/2013.4.29 . . . . 1 match
[[TableOfContents]]
- 정모/2013.4.8 . . . . 1 match
[[TableOfContents]]
- 정모/2013.5.13 . . . . 1 match
[[TableOfContents]]
- 정모/2013.5.20 . . . . 1 match
[[TableOfContents]]
= World IT Show =
[http://www.worlditshow.co.kr/main/main.php 홈페이지]
- 정모/2013.5.6 . . . . 1 match
[[TableOfContents]]
- 정모/2013.6.10 . . . . 1 match
[[TableOfContents]]
- 정모/2013.6.3 . . . . 1 match
[[TableOfContents]]
- 정모/2013.7.15 . . . . 1 match
[[TableOfContents]]
- 정모/2013.7.29 . . . . 1 match
[[TableOfContents]]
- 정모/2013.7.8 . . . . 1 match
[[TableOfContents]]
- 정모/2013.8.12 . . . . 1 match
[[TableOfContents]]
- 정모/2013.8.19 . . . . 1 match
[[TableOfContents]]
- 정모/2013.8.26 . . . . 1 match
[[TableOfContents]]
- 정모/2013.8.5 . . . . 1 match
[[TableOfContents]]
- 정신병원에서뛰쳐나온디자인/밑줄긋기 . . . . 1 match
[[TableOfContents]]
- 정현지 . . . . 1 match
||[[TableOfContents]]||
- 제12회 한국자바개발자 컨퍼런스 후기/유상민의후기 . . . . 1 match
<<TableOfContents>>
- 제13회 한국게임컨퍼런스 후기 . . . . 1 match
[[TableOfContents]]
- 제로Wiki . . . . 1 match
[[TableOfContents]]
- 제로스 . . . . 1 match
[[TableOfContents]]
- 제로페이지의문제점 . . . . 1 match
[[TableOfContents]]
- 제로페이지의장점 . . . . 1 match
나는 잡다하게도 말고 딱 하나를 들고 싶다. 다양성. 생태계를 보면 진화는 접경에서 빨리 진행하는데 그 이유는 접경에 종의 다양성이 보장되기 때문이다. ["제로페이지는"] 수많은 가(edge)를 갖고 중층적 접경 속에 있으며, 거기에서 오는 다양성을 용인, 격려한다(see also NoSmok:CelebrationOfDifferences). 내가 굳이 제로페이지(혹은 거기에 모이는 사람들)를 다른 모임과 차별화 해서 본다면 이것이 아닐까 생각한다. --JuNe
학풍이라는 것이 있다. 집단마다 공부하는 태도나 분위기가 어느 정도 고유하고, 이는 또 전승되기 마련이다. 내가 1학년 때('93) ZeroPage에서 접했던 언어들만 보면, C 언어, 어셈블리어, 파스칼, C++ 등 경계가 없었다. 친구들을 모아서 같이 ''Tao of Objects''라는 당시 구하기도 힘든 "전문" OOP 서적을 공부하기도 했다. 가르쳐줄 사람이 있었고 구하는 사람이 있었으며 함께할 사람이 있었다. 이 학풍을 이어 나갔으면 한다. --JuNe
- 조동영 . . . . 1 match
||[[TableOfContents]]||
== Profile ==
- 조영준 . . . . 1 match
[[TableOfContents]]
* [http://codeforces.com/profile/skywave codeforces]
* KCD 5th 참여 http://kcd2015.onoffmix.com/
- 조현태 . . . . 1 match
[[TableOfContents]]
- 졸업논문 . . . . 1 match
= How to =
- 좋은글귀s . . . . 1 match
[[TableOfContents]]
- 지금그때2003/선전문 . . . . 1 match
[[TableOfContents]]
- 지금그때2003/토론20030310 . . . . 1 match
[[TableOfContents]]
- 지금그때2005/리허설 . . . . 1 match
[[TableOfContents]]
- 지금그때2006 . . . . 1 match
[[TableOfContents]]
- 지금그때2006/선전문 . . . . 1 match
[[TableOfContents]]
- 지금그때2006/홍보 . . . . 1 match
[[TableOfContents]]
- 찜질방원정대 . . . . 1 match
=== How to escape from invincible solo corps ===
- 창섭/BitmapMasking . . . . 1 match
[[TableOfContents]]
- 창섭/삽질 . . . . 1 match
[[TableOfContents]]
- 창섭/통기타 . . . . 1 match
[[TableOfContents]]
- 축적과변화 . . . . 1 match
컴퓨터를 공부하는 사람들이 각자 자신의 일상에서 하루하루 열심히, 차근차근 공부하는 것도 중요하겠지만, 자신의 컴퓨터 역사에서 "계단"이라고 부를만한 시점이 정말 몇 번이나 있었나 되짚어 보는 것도 아주 중요합니다. 그리고, 주변에 그럴만한 기회가 있다면 적극적으로 참여하고, 또 그런 기회를 만들어 내는 것이 좋습니다. 그런데 이런 변화의 기회라는 것은 나의 세계와 이질적인 것일 수록 그 가능성과 타격(!) 정도가 높습니다. (see also NoSmok:CelebrationOfDifferences ) 그렇지만 완전히 다르기만 해서는 안됩니다. 같으면서 달라야 합니다. 예컨대, 내가 아주 익숙한 세계로 알았는데 그걸 전혀 낯설게 보고 있는 세계, 그런것 말이죠.
- 캠이랑놀자 . . . . 1 match
|| 2 || 05.9.25 || [캠이랑놀자/050925] || DirectShow 개관. 뼈대 코드 구경. 간단한 캠영상 플레이 프로그램 만들기 || . ||
|| 13 || 06.1.13 || [캠이랑놀자/060113] 1시 || How to solve it using Image Processing (?) || . ||
* DirectShow 나 OpenCV 중 하나
- 코드레이스/2007/RUR_PLE . . . . 1 match
[[TableOfContents]]
turn_off()
turn_off()
turn_off()
- 코바예제/시계 . . . . 1 match
[[TableOfContents]]
- 코바용어정리 . . . . 1 match
[[TableOfContents]]
- 타도코코아CppStudy/객체지향발표 . . . . 1 match
[[TableOfContents]]
- 탈무드 . . . . 1 match
[[TableOfContents]]
- 토비의스프링3/밑줄긋기 . . . . 1 match
[[TableOfContents]]
- 토비의스프링3/오브젝트와의존관계 . . . . 1 match
[[TableOfContents]]
* DaoFactory 장점 : 애플리케이션의 컴포넌트 역할을 하는 오브젝트와 구조를 결정하는 오브젝트를 분리.
public class DaoFactory{
public class DaoFactory{
public class DaoFactory{}
public class DaoFactory{
ApplicatioContext context = new AnnotationConfigApplicationContext(DaoFactory.class);
ApplicatioContext context = new AnnotationConfigApplicationContext(DaoFactory.class);
class DaoFactory {
- 파스칼삼각형/sksmsvlxk . . . . 1 match
cout << "How many lines?? : ";
- 페이지이름 . . . . 1 match
|| [[TableOfContents]] ||
- 페이지제목띄어쓰기토론 . . . . 1 match
[[TableOfContents]]
- 프로그래밍잔치/첫째날후기 . . . . 1 match
학부생이 공부해볼만한 언어로는 Scheme이 추천되었는데, StructureAndInterpretationOfComputerPrograms란 책을 공부하기 위해서 Scheme을 공부하는 것도 그럴만한 가치가 있다고 했다. 특히 SICP를 공부하면 Scheme, 영어(VOD 등을 통해), 전산이론을 동시에 배우는 일석삼조가 될 수 있다. 또 다른 언어로는 Smalltalk가 추천되었다. OOP의 진수를 보고 싶은 사람들은 Smalltalk를 배우면 큰 깨달음을 얻을 수 있다.
- 프로그래밍파티 . . . . 1 match
|| ZeroPage #1 || ZeroPage #2 || MentorOfArts ||
- 피아노연주자 . . . . 1 match
[[TableOfContents]]
- 한비자 . . . . 1 match
[[TableOfContents]]
- 한자공 . . . . 1 match
[[TableOfContents]]
- 한자공/시즌1 . . . . 1 match
[[TableOfContents]]
- 허아영/C코딩연습 . . . . 1 match
|| [[TableOfContents]] ||
[[ The contents of score array ]]
- 혀뉘 . . . . 1 match
[[TableOfContents]]
* 칵테일 - Long Island Iced Tea
- 홈페이지만들기/css . . . . 1 match
[[TableOfContents]]
- 회비/2002년이전 . . . . 1 match
[[TableOfContents]]
- 회원 . . . . 1 match
[[TableOfContents]]
- 회칙 . . . . 1 match
[[TableOfContents]]
Found 1225 matching pages out of 7540 total pages (5000 pages are searched)
You can also click here to search title.
